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.
Articles by others on the same topic
The Hardy hierarchy is a classification of certain functions based on their growth rates. It is particularly relevant in the context of mathematical logic and computability theory. The functions in the Hardy hierarchy are often denoted as \( f_\alpha(n) \) for ordinals \( \alpha \). The basic idea is to categorize functions into levels based on how they grow.