Large Veblen ordinal: Difference between revisions

Jump to navigation Jump to search
no edit summary
(Created page with "The large Veblen ordinal is a large extension of the small Veblen ordinal. By using an entry-indexing notation (formally defined via finitely-supported ordinal functions), it is possible to further extend the multi-variable version of the Veblen hierarchy used to define the small Veblen ordinal to an array-like system with infinitely long arrays. In particular, the small Veblen ordinal can be denoted by \( \varphi(1,...,0,0) \), with \( \omega \) many zeroes. The...")
 
No edit summary
Line 1:
The large Veblen ordinal is a large extension of the [[small Veblen ordinal]]. By using an entry-indexing notation (formally defined via finitely-supported ordinal functions), it is possible to further extend the multi-variable version of the [[Veblen hierarchy]] used to define the small Veblen ordinal to an array-like system with infinitely long arrays. In particular, the small Veblen ordinal can be denoted by \( \varphi(1,...,0,0) \), with \( \omega \) many zeroes. The new limit of this system is the large Veblen ordinal, or the fixed point of \( \alpha \mapsto \varphi(1 @ \alpha) \), where \( 1 @ \alpha \) denotes a one followed by \( \alpha \) many zeroes. This is another milestone of the recursive ordinals, and may be represented in ordinal collapsing functions as the collapse of \( \Omega^{\Omega^\Omega} \). This system has further been extended to a system known a dimensional Veblen, where one can diagonalize over the amount of zeroes with expressions such as \( \varphi(1 @ (1,0)) \), which represents the large Veblen ordinal. This system's limit is the [[Bachmann-Howard ordinal]].
Cookies help us deliver our services. By using our services, you agree to our use of cookies.

Navigation menu