Omega^omega: Difference between revisions

From Apeirology Wiki
Jump to navigation Jump to search
Content added Content deleted
No edit summary
No edit summary
Line 4: Line 4:
* The least limit of additive principal ordinals.
* The least limit of additive principal ordinals.
* The least ordinal which is, for all \( n < \omega \), an element of the class \( L^n(\mathrm{Ord}) \), where \( L \) is the limit point operator.
* The least ordinal which is, for all \( n < \omega \), an element of the class \( L^n(\mathrm{Ord}) \), where \( L \) is the limit point operator.
* The proof-theoretic ordinal of second-order arithmetic with comprehension restricted to \( \Delta^0_0 \)-formulae.
* The proof-theoretic ordinal of [[Second-order arithmetic|\(\mathrm{RCA}_0\)]]
* The proof-theoretic ordinal of second-order arithmetic with comprehension restricted to \( \Delta^0_0 \)-formulae, with Weak König's Lemma adjoined.
* The proof-theoretic ordinal of [[Second-order arithmetic|\(\mathrm{WKL}_0\)]].
* The proof-theoretic ordinal of Peano arithmetic, with induction restricted to \( \Sigma^0_1 \)-formulae.
* The proof-theoretic ordinal of Peano arithmetic, with induction restricted to \( \Sigma^0_1 \)-formulae.
* The proof-theoretic ordinal of primitive recursive arithmetic.
* The proof-theoretic ordinal of primitive recursive arithmetic.

Revision as of 16:26, 30 August 2023

The ordinal \( \omega^\omega \) is relatively small compared to other countable ordinals, but has some interesting properties. In particular, \( \omega^\omega \) is:

  • The least \( \alpha \) so that \( \alpha \) is the \( \alpha \)th limit ordinal.
  • The least limit of additive principal ordinals.
  • The least ordinal which is, for all \( n < \omega \), an element of the class \( L^n(\mathrm{Ord}) \), where \( L \) is the limit point operator.
  • The proof-theoretic ordinal of \(\mathrm{RCA}_0\)
  • The proof-theoretic ordinal of \(\mathrm{WKL}_0\).
  • The proof-theoretic ordinal of Peano arithmetic, with induction restricted to \( \Sigma^0_1 \)-formulae.
  • The proof-theoretic ordinal of primitive recursive arithmetic.