\(\Pi_1^1\)-comprehension as a well-ordering principle
From MaRDI portal
Publication:2274030
DOI10.1016/j.aim.2019.106767zbMath1441.03012arXiv1809.06759MaRDI QIDQ2274030
Publication date: 19 September 2019
Published in: Advances in Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1809.06759
ATR; reverse mathematics; ordinal analysis; admissible sets; well-ordering principles; dilators; \(\Pi_1^1\)-CA; \(\Pi_1^1\)-comprehension
03B30: Foundations of classical theories (including reverse mathematics)
03F35: Second- and higher-order arithmetic and fragments
03F15: Recursive ordinals and ordinal notations
03D60: Computability and recursion theory on ordinals, admissible sets, etc.
Related Items
From Kruskal’s theorem to Friedman’s gap condition, PREDICATIVE COLLAPSING PRINCIPLES, Set-theoretic reflection is equivalent to induction over well-founded classes, Computable aspects of the Bachmann–Howard principle, HOW STRONG ARE SINGLE FIXED POINTS OF NORMAL FUNCTIONS?, WELL ORDERING PRINCIPLES AND -STATEMENTS: A PILOT STUDY, A categorical construction of Bachmann–Howard fixed points, Derivatives of normal functions in reverse mathematics
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Proof theory. The first step into impredicativity
- Reverse mathematics and well-ordering principles: a pilot study
- Induktive Definitionen und Dilatoren. (Inductive definitions and dilators)
- Proof-theoretic investigations on Kruskal's theorem
- Finite investigations of transfinite derivations
- Bar induction and \(\omega\) model reflection
- Reverse mathematics and ordinal exponentiation
- Notation systems for infinitary derivations
- Introduction to \(\Pi^1_2\)-logic
- The Veblen functions for computability theorists
- Open Questions in Reverse Mathematics
- Ein System des Verknüpfenden Schliessens
- Countable Admissible Ordinals and Dilators
- Beweistheorie vonKPN
- Π12-logic, Part 1: Dilators
- Zur Beweistheorie Der Kripke-Platek-Mengenlehre Über Den Natürlichen Zahlen
- Set Theory
- Computable aspects of the Bachmann–Howard principle
- A categorical construction of Bachmann–Howard fixed points
- Well-Ordering Principles and Bar Induction
- Eine Grenze Für die Beweisbarkeit der Transfiniten Induktion in der Verzweigten Typenlogik