Reverse mathematics and well-ordering principles
From MaRDI portal
Publication:2906572
zbMATH Open1260.03018MaRDI QIDQ2906572FDOQ2906572
Authors: Michael Rathjen, Andreas Weiermann 
Publication date: 5 September 2012
Recommendations
Cut-elimination and normal-form theorems (03F05) Foundations of classical theories (including reverse mathematics) (03B30) Second- and higher-order arithmetic and fragments (03F35) Recursive ordinals and ordinal notations (03F15)
Cited In (24)
- On some properties of reverse Polish notation
- Reverse mathematics of separably closed sets
- Reverse mathematics and ordinal exponentiation
- On the logical strength of the better quasi order with three elements
- Well-ordering Principles, ω-models and $$ \varPi_{1}^{1} $$-comprehension
- Functorial Fast-Growing Hierarchies
- WELL ORDERING PRINCIPLES AND -STATEMENTS: A PILOT STUDY
- Predicative collapsing principles
- Reverse mathematics: the playground of logic
- Well-Ordering Principles in Proof Theory and Reverse Mathematics
- Title not available (Why is that?)
- Derivatives of normal functions and \(\omega \)-models
- Degrees bounding principles and universal instances in reverse mathematics
- Well ordering principles for iterated \(\Pi^1_1\)-comprehension
- Bishop-Style Constructive Reverse Mathematics
- Reverse mathematics and well-ordering principles: a pilot study
- Proof-theoretic strengths of the well-ordering principles
- Computable aspects of the Bachmann-Howard principle
- Title not available (Why is that?)
- \(\Pi_1^1\)-comprehension as a well-ordering principle
- Title not available (Why is that?)
- Reverse mathematics and properties of finite character
- Title not available (Why is that?)
- The reverse mathematics of wqos and bqos
This page was built for publication: Reverse mathematics and well-ordering principles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2906572)
