Admissible ordinal
From Wikipedia, the free encyclopedia
In set theory, an admissible ordinal is any ordinal α such that Lα is a standard set model of Kripke–Platek set theory. In this case, Lα is said to be an admissible set.
The first two admissible ordinals are ω and 
(the least non-recursive ordinal, also called the Church-Kleene ordinal).
By a theorem of Sacks, the countable admissible ordinals are exactly those which are constructed in a manner similar to the Church-Kleene ordinal but for Turing machines with oracles. One sometimes writes 
for the α-th ordinal which is either admissible or limit of admissible; an ordinal which is both is called recursively inaccessible: there exists a theory of large ordinals in this manner which is highly parallel to that of (small) large cardinals (we can define recursively Mahlo cardinals, for example). But note that we are still talking about countable ordinals here!
So admissible ordinals seem to be the recursive analogue of regular cardinal numbers.
Notice that α is an admissible ordinal if and only if α is a limit ordinal and there does not exist a γ<α for which there is a Σ1(Lα) mapping from γ onto α. If M is a standard model of KP, then the set of ordinals in M is an admissible ordinal.
[edit] See also
 |
This mathematical logic-related article is a stub. You can help Wikipedia by expanding it. |
