In
set theory
Set theory is the branch of mathematical logic that studies Set (mathematics), sets, which can be informally described as collections of objects. Although objects of any kind can be collected into a set, set theory – as a branch of mathema ...
, an
ordinal number
In set theory, an ordinal number, or ordinal, is a generalization of ordinal numerals (first, second, th, etc.) aimed to extend enumeration to infinite sets.
A finite set can be enumerated by successively labeling each element with the leas ...
''α'' is an admissible ordinal if
L''α'' is an
admissible set (that is, a
transitive model of
Kripke–Platek set theory); in other words, ''α'' is admissible when ''α'' is a
limit ordinal
In set theory, a limit ordinal is an ordinal number that is neither zero nor a successor ordinal. Alternatively, an ordinal λ is a limit ordinal if there is an ordinal less than λ, and whenever β is an ordinal less than λ, then there exists a ...
and L
''α'' ⊧ Σ
0-collection.
[. See in particula]
p. 265
[.] The term was coined by Richard Platek in 1966.
The first two admissible ordinals are ω and
(the least
nonrecursive ordinal, also called the
Church–Kleene ordinal).
Any
regular uncountable cardinal is an admissible ordinal.
By a theorem of
Sacks, the
countable
In mathematics, a Set (mathematics), set is countable if either it is finite set, finite or it can be made in one to one correspondence with the set of natural numbers. Equivalently, a set is ''countable'' if there exists an injective function fro ...
admissible ordinals are exactly those constructed in a manner similar to the Church–Kleene ordinal, but for Turing machines with
oracles.
One sometimes writes
for the
-th ordinal that is either admissible or a limit of admissibles; an ordinal that is both is called ''recursively inaccessible''. There exists a theory of large ordinals in this manner that is highly parallel to that of (small)
large cardinals (one can define recursively
Mahlo ordinals, for example). But all these ordinals are still countable. Therefore, admissible ordinals seem to be the recursive analogue of regular
cardinal number
In mathematics, a cardinal number, or cardinal for short, is what is commonly called the number of elements of a set. In the case of a finite set, its cardinal number, or cardinality is therefore a natural number. For dealing with the cas ...
s.
Notice that ''α'' is an admissible ordinal if and only if ''α'' is a
limit ordinal
In set theory, a limit ordinal is an ordinal number that is neither zero nor a successor ordinal. Alternatively, an ordinal λ is a limit ordinal if there is an ordinal less than λ, and whenever β is an ordinal less than λ, then there exists a ...
and there does not exist a ''γ'' < ''α'' for which there is a Σ
1(L
''α'') mapping from ''γ'' onto ''α''.
is an admissible ordinal iff there is a standard model
of KP whose set of ordinals is
, in fact this may be take as the definition of admissibility.
[J. Barwise, ''Admissible Sets and Structures'' (1976). Cambridge University Press] The
th admissible ordinal is sometimes denoted by
p. 174 or
.
The Friedman-Jensen-Sacks theorem states that countable
is admissible iff there exists some
such that
is the least ordinal not recursive in
. Equivalently, for any countable admissible
, there is an
making
minimal such that
is an admissible structure.
[A. S. Kechris,]
The Theory of Countable Analytical Sets
p. 264
See also
*
α-recursion theory
*
Large countable ordinals
*
Constructible universe
In mathematics, in set theory, the constructible universe (or Gödel's constructible universe), denoted by L, is a particular Class (set theory), class of Set (mathematics), sets that can be described entirely in terms of simpler sets. L is the un ...
*
Regular cardinal
References
Ordinal numbers
{{settheory-stub