Reverse mathematics and ordinal exponentiation

From MaRDI portal
Publication:1315456

DOI10.1016/0168-0072(94)90076-0zbMath0791.03034OpenAlexW1987660018MaRDI QIDQ1315456

Jeffry L. Hirst

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




Related Items (26)

Ordered Groups: A Case Study in Reverse MathematicsOpen Questions in Reverse MathematicsWell-Ordering Principles in Proof Theory and Reverse MathematicsDerivatives of normal functions and \(\omega \)-modelsDerived sequences and reverse mathematicsWell ordering principles for iterated \(\Pi^1_1\)-comprehensionA note on ordinal exponentiation and derivatives of normal functionsPREDICATIVE COLLAPSING PRINCIPLESWeak and strong versions of effective transfinite recursionOn the logical strength of the better quasi order with three elementsFunctorial Fast-Growing HierarchiesThe maximal linear extension theorem in second order arithmeticComputable aspects of the Bachmann–Howard principleThe Reverse Mathematics of wqos and bqosHOW STRONG ARE SINGLE FIXED POINTS OF NORMAL FUNCTIONS?Ackermann and Goodstein go functorialThe Veblen functions for computability theoristsAn order-theoretic characterization of the Howard-Bachmann-hierarchyWELL ORDERING PRINCIPLES AND -STATEMENTS: A PILOT STUDYOn the indecomposability of \(\omega^n\)Ranked structures and arithmetic transfinite recursion\(\Pi_1^1\)-comprehension as a well-ordering principleINDECOMPOSABLE LINEAR ORDERINGS AND HYPERARITHMETIC ANALYSISReverse mathematics and well-ordering principles: a pilot studyWell-ordering Principles, ω-models and $$ \varPi_{1}^{1} $$-comprehensionTransfinite dependent choice and ω-model reflection



Cites Work




This page was built for publication: Reverse mathematics and ordinal exponentiation