my-server
← Wiki Redirected from Howard ordinal

Bachmann–Howard ordinal

In mathematics, the Bachmann–Howard ordinal (also known as the Howard ordinal, or Howard–Bachmann ordinal) is a large countable ordinal. It is the proof-theoretic ordinal of several mathematical theories, such as Kripke–Platek set theory (with the axiom of infinity) and the system CZF of constructive set theory. It was introduced by and .

Definition

The Bachmann–Howard ordinal is defined using an ordinal collapsing function:

  • ε<sub>α</sub> enumerates the epsilon numbers, the ordinals ε such that ω<sup>ε</sup> = ε.
  • Ω = ω<sub>1</sub> is the first uncountable ordinal.
  • ε<sub>Ω+1</sub> is the first epsilon number after Ω = ε<sub>Ω</sub>.
  • ψ(α) is defined to be the smallest ordinal that cannot be constructed by starting with 0, 1, ω and Ω, and repeatedly applying ordinal addition, multiplication and exponentiation, and ψ to previously constructed ordinals (except that ψ can only be applied to arguments less than α, to ensure that it is well defined).
  • The Bachmann–Howard ordinal is ψ(ε<sub>Ω+1</sub>).

The Bachmann–Howard ordinal can also be defined as φ<sub>ε<sub>Ω+1</sub></sub>(0) for an extension of the Veblen functions φ<sub>α</sub> to certain functions α of ordinals; this extension was carried out by Heinz Bachmann and is not completely straightforward.

Citations

References

  • (Slides of a talk given at Fischbachau.)