Patterns of resemblance and Bachmann-Howard fixed points
From MaRDI portal
Publication:2064043
DOI10.1007/s00029-021-00748-wOpenAlexW4205678835MaRDI QIDQ2064043
Publication date: 4 January 2022
Published in: Selecta Mathematica. New Series (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2012.10292
Bachmann-Howard ordinaladmissible setspatterns of resemblancedilators\(\Pi^1_1\)-comprehension\(\Sigma_1\)-elementarity
Foundations of classical theories (including reverse mathematics) (03B30) Recursive ordinals and ordinal notations (03F15) Ordinal and cardinal numbers (03E10) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Bachmann-Howard structure in terms of \(\Sigma_1\)-elementarity
- \(\Sigma _{1}\)-elementarity and Skolem hull operators
- Proof theory. 2nd ed
- Proof-theoretic investigations on Kruskal's theorem
- Knowledge, machines, and the consistency of Reinhardt's strong mechanistic thesis
- Pure patterns of order 2
- Derivatives of normal functions in reverse mathematics
- \(\Pi_1^1\)-comprehension as a well-ordering principle
- Open Questions in Reverse Mathematics
- Π12-logic, Part 1: Dilators
- Zur Beweistheorie Der Kripke-Platek-Mengenlehre Über Den Natürlichen Zahlen
- Computable aspects of the Bachmann–Howard principle
- HOW STRONG ARE SINGLE FIXED POINTS OF NORMAL FUNCTIONS?
- A categorical construction of Bachmann–Howard fixed points
- Assignment of ordinals to patterns of resemblance
- Normal forms for elementary patterns
- Elementary patterns of resemblance
- A note on ordinal exponentiation and derivatives of normal functions