Positive provability logic for uniform reflection principles
From MaRDI portal
Publication:392274
DOI10.1016/J.APAL.2013.07.006zbMATH Open1322.03041arXiv1304.4396OpenAlexW3136553163MaRDI QIDQ392274FDOQ392274
Authors: Lev D. Beklemishev 
Publication date: 13 January 2014
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Abstract: We deal with the fragment of modal logic consisting of implications of formulas built up from the variables and the constant `true' by conjunction and diamonds only. The weaker language allows one to interpret the diamonds as the uniform reflection schemata in arithmetic, possibly of unrestricted logical complexity. We formulate an arithmetically complete calculus with modalities labeled by natural numbers and omega, where omega corresponds to the full uniform reflection schema, whereas n<omega corresponds to its restriction to arithmetical Pi_{n+1}-formulas. This calculus is shown to be complete w.r.t. a suitable class of finite Kripke models and to be decidable in polynomial time.
Full work available at URL: https://arxiv.org/abs/1304.4396
Recommendations
Modal logic (including the logic of norms) (03B45) First-order arithmetic and fragments (03F30) Provability logics and related algebras (e.g., diagonalizable algebras) (03F45)
Cites Work
- Arithmetization of metamathematics in a general setting
- Title not available (Why is that?)
- Title not available (Why is that?)
- Provability algebras and proof-theoretic ordinals. I
- Reflection principles and provability algebras in formal arithmetic
- On strong provability predicates and the associated modal logics
- A guide to completeness and complexity for modal logics of knowledge and belief
- On the positive fragment of the polymodal provability logic GLP
- A simplified proof of arithmetical completeness theorem for provability logic GLP
- Topological completeness of the provability logic GLP
- Calibrating provability logic: from modal logic to reflection calculus
- Reflection Principles and their Use for Establishing the Complexity of Axiomatic Systems
- Kripke semantics for provability logic GLP
Cited In (22)
- AN ESCAPE FROM VARDANYAN’S THEOREM
- Reflection calculus and conservativity spectra
- Title not available (Why is that?)
- Calibrating provability logic: from modal logic to reflection calculus
- VARIETIES OF POSITIVE MODAL ALGEBRAS AND STRUCTURAL COMPLETENESS
- Reflection algebras and conservation results for theories of iterated truth
- The logic of Turing progressions
- On provability logics with linearly ordered modalities
- Kripke completeness of strictly positive modal logics over meet-semilattices with operators
- Axiomatization and polynomial solvability of strictly positive fragments of certain modal logics
- Title not available (Why is that?)
- A universal algebra for the variable-free fragment of \({\mathrm{RC}^\nabla}\)
- A note on strictly positive logics and word rewriting systems
- Deducibility and independence in Beklemishev's autonomous provability calculus
- The intuitionistic temporal logic of dynamical systems
- The omega-rule interpretation of transfinite provability logic
- Reflection ranks and ordinal analysis
- Title not available (Why is that?)
- A many-sorted variant of Japaridze's polymodal provability logic
- A consistency proof for some restrictions of Tait's reflection principles
- Modal companions of \(K4^+\)
- On the reflection calculus with partial conservativity operators
This page was built for publication: Positive provability logic for uniform reflection principles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q392274)
