Large Veblen ordinal: Difference between revisions
no edit summary
RhubarbJayde (talk | contribs) (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 |
||
(4 intermediate revisions by 2 users not shown) | |||
Line 1:
The '''large Veblen ordinal''', also called the '''great Veblen number''',<ref>Rathjen, https://www1.maths.leeds.ac.uk/~rathjen/ICMend.pdf, p.10</ref> 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,
|