PREDICATIVE COLLAPSING PRINCIPLES

DOI10.1017/jsl.2019.83zbMath1479.03007arXiv1906.07448OpenAlexW2995344442MaRDI QIDQ5107241

Anton Freund

Publication date: 17 April 2020

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

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

zbMATH Keywords

Veblen functionreverse mathematicsarithmetical transfinite recursionarithmetical comprehensionwell-ordering principlesdilatorsBachmann-Howard fixed points

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)

Related Items

Minimal bad sequences are necessary for a uniform Kruskal theorem, Well ordering principles for iterated \(\Pi^1_1\)-comprehension, Bachmann-Howard derivatives, Ackermann and Goodstein go functorial

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reverse mathematics and well-ordering principles: a pilot study
• Proof-theoretic investigations on Kruskal's theorem
• Reverse mathematics and ordinal exponentiation
• Transfinite induction within Peano arithmetic
• Derivatives of normal functions in reverse mathematics
• \(\Pi_1^1\)-comprehension as a well-ordering principle
• The Veblen functions for computability theorists
• Π12-logic, Part 1: Dilators
• Computable aspects of the Bachmann–Howard principle
• HOW STRONG ARE SINGLE FIXED POINTS OF NORMAL FUNCTIONS?
• A categorical construction of Bachmann–Howard fixed points
• A Survey on Ordinal Notations Around the Bachmann–Howard Ordinal
• Well-Ordering Principles and Bar Induction