WELL ORDERING PRINCIPLES AND -STATEMENTS: A PILOT STUDY
From MaRDI portal
Publication:5159496
DOI10.1017/jsl.2021.22zbMath1486.03022arXiv2006.12111OpenAlexW3132012723MaRDI QIDQ5159496
Publication date: 27 October 2021
Published in: The Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2006.12111
reverse mathematicsdilatorswell ordering principlesptykes\( \Pi^1_2\)-induction\(\Pi^1_4\)-statements
Foundations of classical theories (including reverse mathematics) (03B30) Second- and higher-order arithmetic and fragments (03F35) Recursive ordinals and ordinal notations (03F15) Higher-type and set recursion theory (03D65)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Set recursion and \(\Pi ^ 1_ 2\)-logic
- Harvey Friedman's research on the foundations of mathematics
- Reverse mathematics and ordinal exponentiation
- An ordinal analysis of parameter free \(\Pi^{1}_{2}\)-comprehension
- Derivatives of normal functions in reverse mathematics
- \(\Pi_1^1\)-comprehension as a well-ordering principle
- The Veblen functions for computability theorists
- Π12-logic, Part 1: Dilators
- Embeddability of ptykes
- From Kruskal’s theorem to Friedman’s gap condition
- Well-ordering Principles, ω-models and $$ \varPi_{1}^{1} $$-comprehension
- Computable aspects of the Bachmann–Howard principle
- HOW STRONG ARE SINGLE FIXED POINTS OF NORMAL FUNCTIONS?
- A categorical construction of Bachmann–Howard fixed points
- Well-Ordering Principles and Bar Induction
- What is effective transfinite recursion in reverse mathematics?
- A note on ordinal exponentiation and derivatives of normal functions
