Nonrecursive ordinal

In mathematics, particularly set theory, non-recursive ordinals are large countable ordinals greater than all the recursive ordinals, and therefore can not be expressed using recursive ordinal notations.

The Church–Kleene ordinal and variants

The smallest non-recursive ordinal is the Church Kleene ordinal, $\omega _{1}^{\mathsf {CK}}$, named after Alonzo Church and S. C. Kleene; its order type is the set of all recursive ordinals. Since the successor of a recursive ordinal is recursive, the Church–Kleene ordinal is a limit ordinal. It is also the smallest ordinal that is not hyperarithmetical, and the smallest admissible ordinal after $\omega$ (an ordinal $\alpha$ is called admissible if $L_{\alpha }\models {\mathsf {KP}}$.) The $\omega _{1}^{\mathsf {CK}}$-recursive subsets of $\omega$ are exactly the $\Delta _{1}^{1}$ subsets of $\omega$.

The notation $\omega _{1}^{\mathsf {CK}}$ is in reference to $\omega _{1}$, the first uncountable ordinal, which is the set of all countable ordinals, analogously to how the Church-Kleene ordinal is the set of all recursive ordinals. Some old sources use $\omega _{1}$ to denote the Church-Kleene ordinal.

For a set $x\subseteq \mathbb {N}$, A set is x-computable if it is computable from a Turing machine with an oracle state that queries x. The relativized Church–Kleene ordinal $\omega _{1}^{x}$ is the supremum of the order types of x-computable relations. The Friedman-Jensen-Sacks theorem states that for every countable admissible ordinal $\alpha$, there exists a set x such that $\alpha =\omega _{1}^{x}$.

$\omega _{\omega }^{\mathsf {CK}}$, first defined by Stephen G. Simpson is an extension of the Church–Kleene ordinal. This is the smallest limit of admissible ordinals, yet this ordinal is not admissible. Alternatively, this is the smallest α such that $L_{\alpha }\cap {\mathsf {P}}(\omega )$ is a model of $\Pi _{1}^{1}$-comprehension.

Recursively ordinals

The $\alpha$th admissible ordinal is sometimes denoted by $\tau _{\alpha }$.

Recursively "x" ordinals, where "x" typically represents a large cardinal property, are kinds of nonrecursive ordinals.

An ordinal $\alpha$ is called recursively inaccessible if it is admissible and a limit of admissibles. Alternatively, $\alpha$ is recursively inaccessible iff $\alpha$ is the $\alpha$th admissible ordinal, or iff $L_{\alpha }\models {\mathsf {KPi}}$, an extension of Kripke–Platek set theory stating that each set is contained in a model of Kripke–Platek set theory. Under the condition that $L_{\alpha }\vDash {\textrm {V=HC}}$ ("every set is hereditarily countable"), $\alpha$ is recursively inaccessible iff $L_{\alpha }\cap {\mathsf {P}}(\omega )$ is a model of $\Delta _{2}^{1}$-comprehension.

An ordinal $\alpha$ is called recursively hyperinaccessible if it is recursively inaccessible and a limit of recursively inaccessibles, or where $\alpha$ is the $\alpha$th recursively inaccessible. Like "hyper-inaccessible cardinal", different authors conflict on this terminology.

An ordinal $\alpha$ is called recursively Mahlo if it is admissible and for any $\alpha$-recursive function $f:\alpha \rightarrow \alpha$ there is an admissible $\beta <\alpha$ such that $\left\{f(\gamma )\mid \gamma \in \beta \right\}\subseteq \beta$ (that is, $\beta$ is closed under $f$). Mirroring the Mahloness hierarchy, $\alpha$ is recursively $\gamma$-Mahlo for an ordinal $\gamma$ if it is admissible and for any $\alpha$-recursive function $f:\alpha \rightarrow \alpha$ there is an admissible ordinal $\beta <\alpha$ such that $\beta$ is closed under $f$, and $\beta$ is recursively $\delta$-Mahlo for all $\delta <\gamma$.

An ordinal $\alpha$ is called recursively weakly compact if it is $\Pi _{3}$-reflecting, or equivalently, 2-admissible. These ordinals have strong recursive Mahloness properties, if α is $\Pi _{3}$-reflecting then $\alpha$ is recursively $\alpha$-Mahlo.

Weakenings of stable ordinals

An ordinal $\alpha$ is stable if $L_{\alpha }$ is a $\Sigma _{1}$-elementary-substructure of $L$, denoted $L_{\alpha }\preceq _{1}L$. These are some of the largest named nonrecursive ordinals appearing in a model-theoretic context, for instance greater than $\min\{\alpha :L_{\alpha }\models T\}$ for any computably axiomatizable theory $T$.^{Proposition 0.7}. There are various weakenings of stable ordinals:

• A countable ordinal $\alpha$ is called $(+1)$-stable iff $L_{\alpha }\preceq _{1}L_{\alpha +1}$.
  • The smallest $(+1)$-stable ordinal is much larger than the smallest recursively weakly compact ordinal: it has been shown that the smallest $(+1)$-stable ordinal is $\Pi _{n}$-reflecting for all finite $n$.
  • In general, a countable ordinal $\alpha$ is called $(+\beta )$-stable iff $L_{\alpha }\preceq _{1}L_{\alpha +\beta }$.
• A countable ordinal $\alpha$ is called $(^{+})$-stable iff $L_{\alpha }\preceq _{1}L_{\alpha ^{+}}$, where $\beta ^{+}$ is the smallest admissible ordinal $>\beta$. The smallest $(^{+})$-stable ordinal is again much larger than the smallest $(+1)$-stable or the smallest $(+\beta )$-stable for any constant $\beta$.
• A countable ordinal $\alpha$ is called $(^{++})$-stable iff $L_{\alpha }\preceq _{1}L_{\alpha ^{++}}$, where $\beta ^{++}$ are the two smallest admissible ordinals $>\beta$. The smallest $(^{++})$-stable ordinal is larger than the smallest $\Sigma _{1}^{1}$-reflecting.
• A countable ordinal $\alpha$ is called inaccessibly-stable iff $L_{\alpha }\preceq _{1}L_{\beta }$, where $\beta$ is the smallest recursively inaccessible ordinal $>\alpha$. The smallest inaccessibly-stable ordinal is larger than the smallest $(^{++})$-stable.
• A countable ordinal $\alpha$ is called Mahlo-stable iff $L_{\alpha }\preceq _{1}L_{\beta }$, where $\beta$ is the smallest recursively Mahlo ordinal $>\alpha$. The smallest Mahlo-stable ordinal is larger than the smallest inaccessibly-stable.
• A countable ordinal $\alpha$ is called doubly $(+1)$-stable iff $L_{\alpha }\preceq _{1}L_{\beta }\preceq _{1}L_{\beta +1}$. The smallest doubly $(+1)$-stable ordinal is larger than the smallest Mahlo-stable.

Larger nonrecursive ordinals

• The least ordinal $\alpha$ such that $L_{\alpha }\preceq _{1}L_{\beta }$ where $\beta$ is the smallest nonprojectible ordinal.
• An ordinal $\alpha$ is nonprojectible if $\alpha$ is a limit of $\alpha$-stable ordinals, or; if the set $X=\left\{\beta <\alpha \mid L_{\beta }\preceq _{1}L_{\alpha }\right\}$ is unbounded in $\alpha$.
• The ordinal of ramified analysis, often written as $\beta _{0}$. This is the smallest $\beta$ such that $L_{\beta }\cap {\mathsf {P}}(\omega )$ is a model of second-order comprehension, or $L_{\beta }\models {\mathsf {ZFC^{-}}}$, ${\mathsf {ZFC}}$ without the powerset axiom.
• The least ordinal $\alpha$ such that $L_{\alpha }\models {\mathsf {KP}}+'\omega _{1}{\textrm {exists}}'$. This ordinal has been characterized by Toshiyasu Arai.
• The least ordinal $\alpha$ such that $L_{\alpha }\models {\mathsf {ZFC^{-}}}+'\omega _{1}{\textrm {exists}}'$.
• The least stable ordinal.

References

• Church, Alonzo; Kleene, S. C. (1937), "Formal definitions in the theory of ordinal numbers.", Fundamenta Mathematicae, 28: 11–21, doi:10.4064/fm-28-1-11-21, JFM 63.0029.02
• Church, Alonzo (1938), "The constructive second number class", Bull. Amer. Math. Soc., 44 (4): 224–232, doi:10.1090/S0002-9904-1938-06720-1
• Kleene, S. C. (1938), "On Notation for Ordinal Numbers", Journal of Symbolic Logic, 3 (4), Vol. 3, No. 4: 150–155, doi:10.2307/2267778, JSTOR 2267778, S2CID 34314018
• Rogers, Hartley (1987) [1967], The Theory of Recursive Functions and Effective Computability, First MIT press paperback edition, ISBN 978-0-262-68052-3
• Simpson, Stephen G. (2009) [1999], Subsystems of Second-Order Arithmetic, Perspectives in Logic, vol. 2, Cambridge University Press, pp. 246, 267, 292–293, ISBN 978-0-521-88439-6
• Richter, Wayne; Aczel, Peter (1974), Inductive Definitions and Reflecting Properties of Admissible Ordinals, pp. 312–313, 333, ISBN 0-7204-2276-0