A categorical construction of Bachmann–Howard fixed points

DOI10.1112/BLMS.12285zbMath1448.03008arXiv1809.06769OpenAlexW2891361014MaRDI QIDQ5205443

Anton Freund

Publication date: 11 December 2019

Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

reverse mathematicsdilator\(\Pi^1_1\) comprehensionBachmann-Howard fixed point

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Second- and higher-order arithmetic and fragments (03F35) Recursive ordinals and ordinal notations (03F15) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items (12)

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 ⋮ PREDICATIVE COLLAPSING PRINCIPLES ⋮ Bachmann-Howard derivatives ⋮ Computable aspects of the Bachmann–Howard principle ⋮ Derivatives of normal functions in reverse mathematics ⋮ HOW STRONG ARE SINGLE FIXED POINTS OF NORMAL FUNCTIONS? ⋮ WELL ORDERING PRINCIPLES AND -STATEMENTS: A PILOT STUDY ⋮ \(\Pi_1^1\)-comprehension as a well-ordering principle ⋮ Patterns of resemblance and Bachmann-Howard fixed points ⋮ From Kruskal’s theorem to Friedman’s gap condition

Cites Work

• Proof-theoretic investigations on Kruskal's theorem
• \(\Pi_1^1\)-comprehension as a well-ordering principle
• Open Questions in Reverse Mathematics
• Π12-logic, Part 1: Dilators
• A proof-theoretic characterization of the primitive recursive set functions
• Computable aspects of the Bachmann–Howard principle
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A categorical construction of Bachmann–Howard fixed points