Reverse mathematics and ordinal exponentiation
From MaRDI portal
Publication:1315456
DOI10.1016/0168-0072(94)90076-0zbMath0791.03034OpenAlexW1987660018MaRDI QIDQ1315456
Publication date: 10 March 1994
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0168-0072(94)90076-0
\(\text{ATR}_ 0\)Cantor's Normal Form Theoremordinal exponentiationSherman's Inequality for countable well- orderings
Related Items (26)
Ordered Groups: A Case Study in Reverse Mathematics ⋮ Open Questions in Reverse Mathematics ⋮ Well-Ordering Principles in Proof Theory and Reverse Mathematics ⋮ Derivatives of normal functions and \(\omega \)-models ⋮ Derived sequences 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 ⋮ Weak and strong versions of effective transfinite recursion ⋮ On the logical strength of the better quasi order with three elements ⋮ Functorial Fast-Growing Hierarchies ⋮ The maximal linear extension theorem in second order arithmetic ⋮ Computable aspects of the Bachmann–Howard principle ⋮ The Reverse Mathematics of wqos and bqos ⋮ HOW STRONG ARE SINGLE FIXED POINTS OF NORMAL FUNCTIONS? ⋮ Ackermann and Goodstein go functorial ⋮ The Veblen functions for computability theorists ⋮ An order-theoretic characterization of the Howard-Bachmann-hierarchy ⋮ WELL ORDERING PRINCIPLES AND -STATEMENTS: A PILOT STUDY ⋮ On the indecomposability of \(\omega^n\) ⋮ Ranked structures and arithmetic transfinite recursion ⋮ \(\Pi_1^1\)-comprehension as a well-ordering principle ⋮ INDECOMPOSABLE LINEAR ORDERINGS AND HYPERARITHMETIC ANALYSIS ⋮ Reverse mathematics and well-ordering principles: a pilot study ⋮ Well-ordering Principles, ω-models and $$ \varPi_{1}^{1} $$-comprehension ⋮ Transfinite dependent choice and ω-model reflection
Cites Work
This page was built for publication: Reverse mathematics and ordinal exponentiation