Computable aspects of the Bachmann–Howard principle

DOI10.1142/S0219061320500063zbMath1457.03027arXiv1809.06774OpenAlexW3102088491MaRDI QIDQ5118047

Anton Freund

Publication date: 4 September 2020

Published in: Journal of Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1809.06774

zbMATH Keywords

reverse mathematicswell-ordering principlesdilators\(\Pi^1_1\)-comprehensionnotation systemBachmann-Howard fixed pointsATR\(_0\)

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Recursive ordinals and ordinal notations (03F15) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items

Minimal bad sequences are necessary for a uniform Kruskal theorem, Well-Ordering Principles in Proof Theory and Reverse Mathematics, Well ordering principles for iterated \(\Pi^1_1\)-comprehension, A note on ordinal exponentiation and derivatives of normal functions, PREDICATIVE COLLAPSING PRINCIPLES, Bachmann-Howard derivatives, Derivatives of normal functions in reverse mathematics, HOW STRONG ARE SINGLE FIXED POINTS OF NORMAL FUNCTIONS?, Ackermann and Goodstein go functorial, WELL ORDERING PRINCIPLES AND -STATEMENTS: A PILOT STUDY, \(\Pi_1^1\)-comprehension as a well-ordering principle, A categorical construction of Bachmann–Howard fixed points, Patterns of resemblance and Bachmann-Howard fixed points, From Kruskal’s theorem to Friedman’s gap condition

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reverse mathematics and well-ordering principles: a pilot study
• Logic colloquium '80. Papers intended for the European Summer Meeting of the Association for Symbolic Logic, held in Prague, August 24-30, 1980
• Proof-theoretic investigations on Kruskal's theorem
• Reverse mathematics and ordinal exponentiation
• \(\Pi_1^1\)-comprehension as a well-ordering principle
• The Veblen functions for computability theorists
• Open Questions in Reverse Mathematics
• Π12-logic, Part 1: Dilators
• A proof-theoretic characterization of the primitive recursive set functions
• A categorical construction of Bachmann–Howard fixed points
• Well-Ordering Principles and Bar Induction