PREDICATIVITY THROUGH TRANSFINITE REFLECTION
From MaRDI portal
Publication:5359565
DOI10.1017/jsl.2017.30zbMath1402.03086arXiv1412.5521OpenAlexW2964107161WikidataQ120373613 ScholiaQ120373613MaRDI QIDQ5359565
Andrés Cordón-Franco, David Fernández-Duque, Joost J. Joosten, F. F. Lara-Martín
Publication date: 26 September 2017
Published in: The Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1412.5521
Second- and higher-order arithmetic and fragments (03F35) Proof theory in general (including proof-theoretic semantics) (03F03) Provability logics and related algebras (e.g., diagonalizable algebras) (03F45)
Related Items (4)
Hyperarithmetical worm battles ⋮ A topological completeness theorem for transfinite provability logic ⋮ The omega-rule interpretation of transfinite provability logic ⋮ MÜNCHHAUSEN PROVABILITY
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On provability logics with linearly ordered modalities
- Harvey Friedman's research on the foundations of mathematics
- Factorization of polynomials and \(\Sigma ^ 0_ 1\) induction
- Induction rules, reflection principles, and provably recursive functions
- Provability algebras and proof-theoretic ordinals. I
- On the reduction property for GLP-algebras
- The polytopologies of transfinite provability logic
- Pi^0_1 ordinal analysis beyond first order arithmetic
- Reflection principles and provability algebras in formal arithmetic
- On some slowly terminating term rewriting systems
- The optimality of induction as an axiomatization of arithmetic
- Church's thesis, continuity, and set theory
- Well-orders in the transfinite Japaridze algebra
- Fragments of Arithmetic and true sentences
- On strong provability predicates and the associated modal logics
- Models of transfinite provability logic
- Systems of predicative analysis
- Systems of predicative analysis, II: Representations of ordinals
- Reflection Principles and their Use for Establishing the Complexity of Axiomatic Systems
This page was built for publication: PREDICATIVITY THROUGH TRANSFINITE REFLECTION
