Buchholz's ordinal

From testwiki
Jump to navigation Jump to search

Template:Short description In mathematics, ψ0ω), widely known as Buchholz's ordinalTemplate:Citation needed, is a large countable ordinal that is used to measure the proof-theoretic strength of some mathematical systems. In particular, it is the proof theoretic ordinal of the subsystem Π11-CA0 of second-order arithmetic;[1][2] this is one of the "big five" subsystems studied in reverse mathematics (Simpson 1999). It is also the proof-theoretic ordinal of 𝖨𝖣<ω, the theory of finitely iterated inductive definitions, and of KP0,[3] a fragment of Kripke-Platek set theory extended by an axiom stating every set is contained in an admissible set. Buchholz's ordinal is also the order type of the segment bounded by D0Dω0 in Buchholz's ordinal notation (𝖮𝖳,<).[1] Lastly, it can be expressed as the limit of the sequence: ε0=ψ0(Ω), 𝖡𝖧𝖮=ψ0(Ω2), ψ0(Ω3), ...

Definition

Template:Main article

  • Ω0=1, and Ωn=n for n > 0.
  • Ci(α) is the closure of Ωi under addition and the ψη(μ) function itself (the latter of which only for μ<α and ηω).
  • ψi(α) is the smallest ordinal not in Ci(α).
  • Thus, ψ0ω) is the smallest ordinal not in the closure of 1 under addition and the ψη(μ) function itself (the latter of which only for μ<Ωω and ηω).

References

Template:Reflist Template:Refbegin

Template:Refend

Template:Countable ordinals


Template:Settheory-stub Template:Number-stub

  1. 1.0 1.1 Template:Cite journal
  2. Template:Cite book
  3. T. Carlson, "Elementary Patterns of Resemblance" (1999). Accessed 12 August 2022.