List of ordinals: Difference between revisions

no edit summary
No edit summary
No edit summary
 
(5 intermediate revisions by the same user not shown)
Line 23:
* [[veblen_hierarchy#zeta|\( \psi_{0}(\Omega^{2}) = \varphi(2,0) = \zeta_{0} \)]]<sup>(decide if own page)</sup>
* [[veblen_hierarchy|\( \psi_{0}(\Omega^{\omega}) = \varphi(\omega,0) \)]], the second infinite primitive recursively principal ordinal
* [[feferman-schutte_ordinal|\( \psi_{0}(\Omega^{\Omega}) = \varphi(1,0,0) = \Gamma_{0} \)]], the Feferman-Schutte ordinal and the PTO of ATR<sub>0</sub>. This is the least \(\alpha\) such that \(L_\alpha\cap\mathcal P(\omega)\) satisfies Feferman's theory \(\mathrm{IR}\).<ref>S. G. Simpson, "[https://sgslogic.net/t20/talks/feferfest/paper3.pdf Predicativity: The Outer Limits]" (2000), p.3. Accessed 30 January 2024.</ref>
* [[the_veblen_hierarchy#ackermann|\( \psi_{0}(\Omega^{\Omega^{2}}) = \varphi(1,0,0,0) \)]], the Ackermann Ordinal<sup>(decide if keep)</sup>
* [[small_veblen_ordinal|\( \psi_{0}(\Omega^{\Omega^{\omega}}) = \varphi\begin{pmatrix}1 \\ \omega\end{pmatrix} \)]], the SVO (Small Veblen ordinal)
Line 69:
** \( \zeta \), the supremum of all eventually writable ordinals = the least \( \Sigma_2 \)-extendible ordinal
** \( \Sigma \), the supremum of all accidentally writable ordinals = the least target of \( \Sigma_2 \)-stability
* The least ordinal in \(E_\etaE_1\), for \(\eta > 0\)<ref name="Welch2010Draft">P. D. Welch, [https://web.archive.org/web/20130108001818/https://maths.bris.ac.uk/~mapdw/det17.pdf Weak Systems of Determinacy and Arithmetical Quasi-Inductive Definitions] (April 2010 draft). Accessed 11 January 2023.</ref> in unpublished work Welch has shown this is an ordinal referred to as \(\zeta^{\varnothing^{\blacktriangledown}}\)<ref>R. S. Lubarsky, "ITTMs with Feedback", in ''[http://wwwmath.uni-muenster.de/logik/Personen/rds/festschrift.pdf Ways of Proof Theory]'', edited by R. Schindler, Ontos Series in Mathematical Logic (2010, p.338).</ref>
* The least ordinal in \(E_\eta\), for \(\eta > 1\)<ref name="Welch2010Draft" />
* The least admissible \(\alpha\) so that \(L_\alpha\) satisfies arithmetically\(\mathsf{AQI}\), arithmetical quasi-induction = the least admissible \(\alpha\) so that, for all \(x \in \mathcal{P}(\omega) \cap L_\alpha\), there are \(\xi, \sigma < \alpha\) so that \(L_\xi[x] \prec_{\Sigma_2} L_\sigma[x]\)<ref name="Welch2010Draft" />{{verification failed}}
* Least \(\beta\) where \(L_\beta\) starts a chain of \(\Sigma_3\)-elementary substructures <ref name="Welch2010Draft" />
* The smallest [[gap ordinal]]<ref name="Gaps">W. Marek, M. Srebrny, [https://www.sciencedirect.com/science/article/pii/0003484374900059 Gaps in the Constructible Universe] (1973). Accessed 7 September 2022.</ref> = the least simultaneously \(\Sigma_n\)-nonprojectible ordinal for all \(n<\omega\)<ref>The Higher Infinite in Proof Theory, Michael Rathjen</ref>
160

edits