Добавить в корзину
), a choice must be made because there is no immediate "previous" function. The system uses a standardized fundamental sequence
In mathematical logic, ordinals measure the strength of mathematical proof systems. FGH connects these abstract proof strengths directly to rapidly growing arithmetic functions.
Ordinals beyond (\omega) are not simple integers; they are infinite objects. Any implementation must choose a finite notation (Cantor normal form, binary ordinal notation, etc.) that can represent the desired ordinals up to a given limit.
