Describing ordinals using functionals of transfinite type

1972 ◽  
Vol 37 (1) ◽  
pp. 35-47 ◽  
Author(s):  
Peter Aczel
Keyword(s):  
Initial Segment ◽  
Normal Functions ◽  
Definition Of ◽  
Image Position

Bachmann, in [2] shows how certain ordinals <Ω(Ω = Ω1 where Ωξ is the (1 + ξ)th infinite initial ordinal) may be described from below using suitable descriptions of ordinals <Ω2. The aim of this paper is to consider another approach to describing ordinal <Ω and compare it with the Bachmann method. Our approach will use functionals of transfinite type based on Ω.The Bachmann method consists in denning a hierarchy of normal functions ϕδ: Ω → Ω (i.e. continuous and strictly increasing) for δ ≤ η0 < Ω2, starting with ϕ0(λ) = ω1 + λ. The definition of depends on a suitable description of the ordinals ≤ η0. This is obtained by defining a hierarchy 〈Fδ ∣ δ ≤ Ω2〉 of normal functions Fδ: Ω2 → Ω2 analogously to the definition of the initial segment 〈ϕδ ∣ δ ≤ Ω〉 of . The ordinal η0 is .Note. Our description of Bachmann's hierarchies will differ slightly from those in Bachmann's paper. Let and denote the hierarchies in [2]. Then as Bachmann's normal functions are not defined at 0 we let for λ, δ < Ω2. Bachmann defines for 0 < λ < Ω2 but it seems more natural to omit this so that we let . The situation is analogous for and leads to the following definitions:where n < ω and ξ is a limit number of cofinality Ω, and

Pascal's Prism

2012 ◽  
Vol 96 (536) ◽  
pp. 213-220
Author(s):  
Harlan J. Brothers
Keyword(s):  
Probability Theory ◽  
Fractal Geometry ◽  
Euclidean Geometry ◽  
Fibonacci Series ◽  
Pascal’S Triangle ◽  
Number Sequences ◽  
Definition Of ◽  
Image Position ◽  
Pascal's Triangle

Pascal's triangle is well known for its numerous connections to probability theory [1], combinatorics, Euclidean geometry, fractal geometry, and many number sequences including the Fibonacci series [2,3,4]. It also has a deep connection to the base of natural logarithms, e [5]. This link to e can be used as a springboard for generating a family of related triangles that together create a rich combinatoric object.2. From Pascal to LeibnizIn Brothers [5], the author shows that the growth of Pascal's triangle is related to the limit definition of e.Specifically, we define the sequence sn; as follows [6]:

The Static Aeroelasticity of Slender Configurations

1963 ◽  
Vol 14 (1) ◽  
pp. 75-104 ◽  
Author(s):  
G. J. Hancock
Keyword(s):  
Static Stability ◽  
Aerodynamic Forces ◽  
Flexible Aircraft ◽  
The Past ◽  
Plate Models ◽  
Non Linear ◽  
The Future ◽  
Static Aeroelasticity ◽  
Definition Of ◽  
Image Position

SummaryThe validity and applicability of the static margin (stick fixed) Kn,where as defined by Gates and Lyon is shown to be restricted to the conventional flexible aircraft. Alternative suggestions for the definition of static margin are put forward which can be equally applied to the conventional flexible aircraft of the past and the integrated flexible aircraft of the future. Calculations have been carried out on simple slender plate models with both linear and non-linear aerodynamic forces to assess their static stability characteristics.

Sublattices and Initial Segments of the Degrees of Unsolvability

1970 ◽  
Vol 22 (3) ◽  
pp. 569-581 ◽  
Author(s):  
S. K. Thomason
Keyword(s):  
Lower Bound ◽  
Upper Bound ◽  
Lattice Theory ◽  
Initial Segment ◽  
Finite Lattice ◽  
Equivalence Relations ◽  
Finite Lattices ◽  
Image Position ◽  
Degrees Of Unsolvability

In this paper we shall prove that every finite lattice is isomorphic to a sublattice of the degrees of unsolvability, and that every one of a certain class of finite lattices is isomorphic to an initial segment of degrees.Acknowledgment. I am grateful to Ralph McKenzie for his assistance in matters of lattice theory.1. Representation of lattices. The equivalence lattice of the set S consists of all equivalence relations on S, ordered by setting θ ≦ θ’ if for all a and b in S, a θ b ⇒ a θ’ b. The least upper bound and greatest lower bound in are given by the ⋃ and ⋂ operations:

The Multiplicative Groups of Quasifields

1987 ◽  
Vol 39 (4) ◽  
pp. 784-793 ◽  
Author(s):  
Michael J. Kallaher
Keyword(s):  
Zero Element ◽  
Binary Operations ◽  
Definition Of ◽  
Image Position ◽  
Multiplicative Groups ◽  
Multiplicative Mapping

Let (Q, +, ·) be a finite quasifield of dimension d over its kernel K = GF(q), where q = pk with p a prime and k ≧ 1. (See p. 18-22 and p. 74 of [7] or Section 5 of [9] for the definition of quasifield.) For the remainder of this article we will follow standard conventions and omit, whenever possible, the binary operations + and · in discussing a quasifield. For example, the notation Q will be used in place of the triple (Q, +, ·) and Q* will be used to represent the multiplicative loop (Q − {0}, ·).Let m be a non-zero element of the quasifield Q; the right multiplicative mapping ρm:Q → Q is defined by1

scholarly journals On the Inversion of the Gauss Transformation

1957 ◽  
Vol 9 ◽  
pp. 459-464 ◽  
Author(s):  
P. G. Rooney
Keyword(s):  
Differential Operator ◽  
Recent Work ◽  
Suitable Definition ◽  
Inversion Theory ◽  
The Subject ◽  
Definition Of ◽  
Image Position ◽  
Gauss Transformation ◽  
Operational Methods

The inversion theory of the Gauss transformation has been the subject of recent work by several authors. If the transformation is defined by1.1,then operational methods indicate that,under a suitable definition of the differential operator.

On the Definition of C*-Algebras II

1985 ◽  
Vol 37 (4) ◽  
pp. 664-681 ◽  
Author(s):  
Zoltán Magyar ◽  
Zoltán Sebestyén
Keyword(s):  
Hilbert Space ◽  
Banach Algebra ◽  
Representation Theorem ◽  
Banach Algebras ◽  
Bounded Operators ◽  
Fundamental Representation ◽  
C Algebras ◽  
Definition Of ◽  
Image Position

The theory of noncommutative involutive Banach algebras (briefly Banach *-algebras) owes its origin to Gelfand and Naimark, who proved in 1943 the fundamental representation theorem that a Banach *-algebra with C*-condition(C*)is *-isomorphic and isometric to a norm-closed self-adjoint subalgebra of all bounded operators on a suitable Hilbert space.At the same time they conjectured that the C*-condition can be replaced by the B*-condition.(B*)In other words any B*-algebra is actually a C*-algebra. This was shown by Glimm and Kadison [5] in 1960.

On the “Third Definition” of the Topology on the Spectrum of a C*-Algebra

1971 ◽  
Vol 23 (3) ◽  
pp. 445-450 ◽  
Author(s):  
L. Terrell Gardner
Keyword(s):  
Hilbert Space ◽  
Quotient Space ◽  
Principal Result ◽  
Irreducible Representations ◽  
C Algebra ◽  
Fell Topology ◽  
The Third ◽  
Definition Of ◽  
Image Position

0. In [3], Fell introduced a topology on Rep (A,H), the collection of all non-null but possibly degenerate *-representations of the C*-algebra A on the Hilbert space H. This topology, which we will call the Fell topology, can be described by giving, as basic open neighbourhoods of π0 ∈ Rep(A, H), sets of the formwhere the ai ∈ A, and the ξj ∈ H(π0), the essential space of π0 [4].A principal result of [3, Theorem 3.1] is that if the Hilbert dimension of H is large enough to admit all irreducible representations of A, then the quotient space Irr(A, H)/∼ can be identified with the spectrum (or “dual“) Â of A, in its hull-kernel topology.

DEEP CLASSES

2016 ◽  
Vol 22 (2) ◽  
pp. 249-286 ◽  
Author(s):  
LAURENT BIENVENU ◽  
CHRISTOPHER P. PORTER
Keyword(s):  
Mutual Information ◽  
Initial Segment ◽  
Computability Theory ◽  
Binary Sequences ◽  
Algorithmic Randomness ◽  
Positive Probability ◽  
Probabilistic Algorithm ◽  
Image Position ◽  
The Relationship ◽  
Mass Problems

AbstractA set of infinite binary sequences ${\cal C} \subseteq 2$ℕ is negligible if there is no partial probabilistic algorithm that produces an element of this set with positive probability. The study of negligibility is of particular interest in the context of ${\rm{\Pi }}_1^0 $ classes. In this paper, we introduce the notion of depth for ${\rm{\Pi }}_1^0 $ classes, which is a stronger form of negligibility. Whereas a negligible ${\rm{\Pi }}_1^0 $ class ${\cal C}$ has the property that one cannot probabilistically compute a member of ${\cal C}$ with positive probability, a deep ${\rm{\Pi }}_1^0 $ class ${\cal C}$ has the property that one cannot probabilistically compute an initial segment of a member of ${\cal C}$ with high probability. That is, the probability of computing a length n initial segment of a deep ${\rm{\Pi }}_1^0 $ class converges to 0 effectively in n.We prove a number of basic results about depth, negligibility, and a variant of negligibility that we call tt-negligibility. We provide a number of examples of deep ${\rm{\Pi }}_1^0 $ classes that occur naturally in computability theory and algorithmic randomness. We also study deep classes in the context of mass problems, examine the relationship between deep classes and certain lowness notions in algorithmic randomness, and establish a relationship between members of deep classes and the amount of mutual information with Chaitin’s Ω.

The þ-function in λ-K-conversion

1937 ◽  
Vol 2 (4) ◽  
pp. 164-164 ◽  
Author(s):  
A. M. Turing
Keyword(s):  
Positive Integer ◽  
Natural Number ◽  
Definition Of ◽  
Image Position

In the theory of conversion it is important to have a formally defined function which assigns to any positive integer n the least integer not less than n which has a given property. The definition of such a formula is somewhat involved: I propose to give the corresponding formula in λ-K-conversion, which will (naturally) be much simpler. I shall in fact find a formula þ such that if T be a formula for which T(n) is convertible to a formula representing a natural number, whenever n represents a natural number, then þ(T, r) is convertible to the formula q representing the least natural number q, not less than r, for which T(q) conv 0.2 The method depends on finding a formula Θ with the property that Θ conv λu·u(Θ(u)), and consequently if M→Θ(V) then M conv V(M). A formula with this property is,The formula þ will have the required property if þ(T, r) conv r when T(r) conv 0, and þ(T, r) conv þ(T, S(r)) otherwise. These conditions will be satisfied if þ(T, r) conv T(r, λx·þ(T, S(r)), r), i.e. if þ conv {λptr·t(r, λx·p(t, S(r)), r)}(þ). We therefore put,This enables us to define also a formula,such that (T, n) is convertible to the formula representing the nth positive integer q for which T(q) conv 0.

INITIAL SEGMENTS OF THE ENUMERATION DEGREES

2016 ◽  
Vol 81 (1) ◽  
pp. 316-325 ◽  
Author(s):  
HRISTO GANCHEV ◽  
ANDREA SORBI
Keyword(s):  
Local Structure ◽  
Initial Segment ◽  
Nonzero Element ◽  
Enumeration Degrees ◽  
Enumeration Degree ◽  
Image Position

AbstractUsing properties of${\cal K}$-pairs of sets, we show that every nonzero enumeration degreeabounds a nontrivial initial segment of enumeration degrees whose nonzero elements have all the same jump asa. Some consequences of this fact are derived, that hold in the local structure of the enumeration degrees, including: There is an initial segment of enumeration degrees, whose nonzero elements are all high; there is a nonsplitting high enumeration degree; every noncappable enumeration degree is high; every nonzero low enumeration degree can be capped by degrees of any possible local jump (i.e., any jump that can be realized by enumeration degrees of the local structure); every enumeration degree that bounds a nonzero element of strictly smaller jump, is bounding; every low enumeration degree below a non low enumeration degreeacan be capped belowa.

Sign in / Sign up

Export Citation Format

Share Document