The omega-rule interpretation of transfinite provability logic
From MaRDI portal
Publication:1694812
DOI10.1016/j.apal.2017.12.006zbMath1429.03211arXiv1302.5393OpenAlexW2963814436WikidataQ120514402 ScholiaQ120514402MaRDI QIDQ1694812
Joost J. Joosten, David Fernández-Duque
Publication date: 6 February 2018
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1302.5393
Modal logic (including the logic of norms) (03B45) Second- and higher-order arithmetic and fragments (03F35) Provability logics and related algebras (e.g., diagonalizable algebras) (03F45)
Related Items (8)
Reflection algebras and conservation results for theories of iterated truth ⋮ Hyperarithmetical worm battles ⋮ Turing Jumps Through Provability ⋮ A topological completeness theorem for transfinite provability logic ⋮ On provability logics with linearly ordered modalities ⋮ Derived topologies on ordinals and stationary reflection ⋮ Turing-Taylor expansions for arithmetic theories ⋮ MÜNCHHAUSEN PROVABILITY
Cites Work
- On provability logics with linearly ordered modalities
- Topological completeness of the provability logic GLP
- Kripke semantics for provability logic GLP
- The analytical completeness of Dzhaparidze's polymodal logics
- Provability logics for natural Turing progressions of arithmetical theories
- Proof theory. The first step into impredicativity
- On the proof of Solovay's theorem
- Independent numerations of theories and recursive progressions
- Provability interpretations of modal logic
- Some results on cut-elimination, provable well-orderings, induction and reflection
- Computable structures and the hyperarithmetical hierarchy
- Provability algebras and proof-theoretic ordinals. I
- Iterated local reflection versus iterated consistency
- The polytopologies of transfinite provability logic
- A simplified proof of arithmetical completeness theorem for provability logic GLP
- Pi^0_1 ordinal analysis beyond first order arithmetic
- A Topological Study of the Closed Fragment of GLP
- The classical and the ω-complete arithmetic
- Bounded Induction and Satisfaction Classes
- ON THE ITERATED ω‐RULE
- On strong provability predicates and the associated modal logics
- Models of transfinite provability logic
- PREDICATIVITY THROUGH TRANSFINITE REFLECTION
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The omega-rule interpretation of transfinite provability logic
