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.)