Predicative collapsing principles

DOI10.1017/JSL.2019.83MaRDI QIDQ5107241zbMATH OpenOpenAlexFDO

Authors Anton Freund

Publication date 17 April 2020

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

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

zbMATH Keywords

reverse mathematicsarithmetical transfinite recursionarithmetical comprehensionVeblen functionwell-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)

Abstract: We show that arithmetical transfinite recursion is equivalent to a suitable formalization of the following: For every ordinal $alpha$ there exists an ordinal $$ such that $$ (ordinal arithmetic) admits an almost order preserving collapse into $$. Arithmetical comprehension is equivalent to a statement of the same form, with $$ at the place of $$. We will also characterize the principles that any set is contained in a countable coded $omega$-model of arithmetical transfinite recursion resp. arithmetical comprehension.

Recommendations

• Ordinal inequalities, transfinite induction, and reverse mathematics
• A note on predicative ordinal analysis. I. Iterated comprehension and transfinite induction
• PREDICATIVITY THROUGH TRANSFINITE REFLECTION
• Reverse mathematics and well-ordering principles
• AN ORDINAL ANALYSIS OF ADMISSIBLE SET THEORY USING RECURSION ON ORDINAL NOTATIONS

Cites work

• scientific article; zbMATH DE number 6536275 (Why is no real title available?)
• scientific article; zbMATH DE number 4033738 (Why is no real title available?)
• scientific article; zbMATH DE number 3572133 (Why is no real title available?)
• A Survey on Ordinal Notations Around the Bachmann–Howard Ordinal
• A categorical construction of Bachmann–Howard fixed points
• Computable aspects of the Bachmann-Howard principle
• Derivatives of normal functions in reverse mathematics
• HOW STRONG ARE SINGLE FIXED POINTS OF NORMAL FUNCTIONS?
• Proof-theoretic investigations on Kruskal's theorem
• Reverse mathematics and ordinal exponentiation
• Reverse mathematics and well-ordering principles
• Reverse mathematics and well-ordering principles: a pilot study
• Subsystems of second order arithmetic
• The Veblen functions for computability theorists
• Transfinite induction within Peano arithmetic
• Well-ordering principles and bar induction
• \(\Pi_1^1\)-comprehension as a well-ordering principle
• Π12-logic, Part 1: Dilators

Cited in

(8)

• Minimal bad sequences are necessary for a uniform Kruskal theorem
• Ackermann and Goodstein go functorial
• Induction on dilators and Bachmann-Howard fixed points
• Bachmann-Howard derivatives
• Well ordering principles for iterated \(\Pi^1_1\)-comprehension
• Computable aspects of the Bachmann-Howard principle
• On inverse Goodstein sequences
• An order-theoretic characterization of the Howard-Bachmann-hierarchy

This page was built for publication: Predicative collapsing principles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5107241)