Long finite sequences

DOI10.1006/jcta.2000.3154zbMath0990.05127OpenAlexW1968600138WikidataQ56532248 ScholiaQ56532248MaRDI QIDQ5940305

Harvey M. Friedman

Publication date: 7 August 2002

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/03dca166fed9d17a4c3507a76a66f8e1951f7d7a

zbMATH Keywords

Ackermann hierarchylongest finite sequences

Mathematics Subject Classification ID

Extremal combinatorics (05D99)

Related Items

Zeno, Hercules, and the Hydra ⋮ Functorial Fast-Growing Hierarchies ⋮ Laver's results and low-dimensional topology

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The varieties of arboreal experience
• Nested recursion
• Elementary descent recursion and proof theory
• Ordinal numbers and the Hilbert basis theorem
• Hierarchies of number-theoretic functions. I
• A classification of the ordinal recursive functions
• Hierarchies of number-theoretic functions I, II: A correction
• Ordinal recursion, and a refinement of the extended Grzegorczyk hierarchy
• Ordering by Divisibility in Abstract Algebras