Hardy hierarchy Created 2026-10-20 Updated 2026-11-05
The Hardy hierarchy assigns increasingly fast-growing functions to ordinals, once fundamental sequences for limit ordinals have been chosen. A common convention isfor nonzero limits , where increases toward . The ordinal notation system and its fundamental sequences are part of the definition.
For finite , this gives . Taking gives . At larger ordinals the recursive nesting produces much faster growth. The hierarchy compares the strength of termination arguments and induction principles in proof theory; changing conventions can shift the exact formulas at particular indices.