Reverse mathematics and well-ordering principles: a pilot study
From MaRDI portal
Publication:1032626
DOI10.1016/j.apal.2009.01.001zbMath1183.03008OpenAlexW2155734270MaRDI QIDQ1032626
Michael Rathjen, Bahareh Afshari
Publication date: 26 October 2009
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://ora.ox.ac.uk/objects/uuid:bb23c580-11c5-499d-852c-7524d1bca6ae
reverse mathematicsACA\(^+_0\)countable coded \(\omega\)-modelsSchütte deduction chainswell-ordering principles
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)
Related Items
Reverse Mathematics: The Playground of Logic, Well-Ordering Principles in Proof Theory and Reverse Mathematics, Derivatives of normal functions and \(\omega \)-models, Reducing ω-model reflection to iterated syntactic reflection, Well ordering principles for iterated \(\Pi^1_1\)-comprehension, PREDICATIVE COLLAPSING PRINCIPLES, On the logical strength of the better quasi order with three elements, Functorial Fast-Growing Hierarchies, Computable aspects of the Bachmann–Howard principle, A few more dissimilarities between second-order arithmetic and set theory, Ackermann and Goodstein go functorial, The Veblen functions for computability theorists, An ordinal analysis for theories of self-referential truth, \(\Pi_1^1\)-comprehension as a well-ordering principle, Proof-theoretic strengths of the well-ordering principles, Well-ordering Principles, ω-models and $$ \varPi_{1}^{1} $$-comprehension
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bar induction and \(\omega\) model reflection
- Reverse mathematics and ordinal exponentiation
- Elementary descent recursion and proof theory
- Proof theory. An introduction
- The role of parameters in bar rule and bar induction
- Descending sequences of degrees
