HOW STRONG ARE SINGLE FIXED POINTS OF NORMAL FUNCTIONS?

DOI10.1017/JSL.2020.24MaRDI QIDQ5148106zbMATH OpenOpenAlexFDO

Authors Anton Freund

Publication date 29 January 2021

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

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

zbMATH Keywords

\(\Pi^1_1\)-inductiondilatorfixed pointnormal functionreverse mathematicswell-ordering principle

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Recursive ordinals and ordinal notations (03F15) Second- and higher-order arithmetic and fragments (03F35)

Abstract: In a recent paper by M. Rathjen and the present author it has been shown that the statement ``every normal function has a derivative is equivalent to $P{i}_1^1$-bar induction. The equivalence was proved over $mathbfAC{A}_0$, for a suitable representation of normal functions in terms of dilators. In the present paper we show that the statement ``every normal function has at least one fixed point is equivalent to $P{i}_1^1$-induction along the natural numbers.

Recommendations

• Derivatives of normal functions in reverse mathematics
• WELL ORDERING PRINCIPLES AND -STATEMENTS: A PILOT STUDY
• A note on ordinal exponentiation and derivatives of normal functions
• Partial impredicativity in reverse mathematics
• scientific article; zbMATH DE number 3924748
• Intrinsically II Relations
• Ordinal inequalities, transfinite induction, and reverse mathematics
• Baire categoricity and \(\Sigma_1^0\)-induction
• A categorical construction of Bachmann–Howard fixed points
• Countable algebra and set existence axioms

Cites work

• \(\Pi_1^1\)-comprehension as a well-ordering principle
• A categorical construction of Bachmann–Howard fixed points
• Computable aspects of the Bachmann-Howard principle
• Derivatives of normal functions in reverse mathematics
• scientific article; zbMATH DE number 4033738 (Why is no real title available?)
• scientific article; zbMATH DE number 3572133 (Why is no real title available?)
• Reverse mathematics and ordinal exponentiation
• Subsystems of second order arithmetic
• The Veblen functions for computability theorists
• Π12-logic, Part 1: Dilators

Cited in

(8)

• Patterns of resemblance and Bachmann-Howard fixed points
• Minimal bad sequences are necessary for a uniform Kruskal theorem
• Full and hat inductive definitions are equivalent in NBG
• Where are typical $C^{1}$ functions one-to-one?
• Predicative collapsing principles
• Computable aspects of the Bachmann-Howard principle
• WELL ORDERING PRINCIPLES AND -STATEMENTS: A PILOT STUDY
• A note on ordinal exponentiation and derivatives of normal functions

This page was built for publication: HOW STRONG ARE SINGLE FIXED POINTS OF NORMAL FUNCTIONS?

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