Bimodal logics for extensions of arithmetical theories

DOI10.2307/2275600zbMath0858.03024OpenAlexW2165953467MaRDI QIDQ4879903

Lev D. Beklemishev

Publication date: 17 March 1997

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2275600

zbMATH Keywords

completenessdecidabilitybimodal provability logicsrecursively enumerable arithmetic

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) First-order arithmetic and fragments (03F30)

Related Items

Provability and interpretability logics with restricted realizations ⋮ The closed fragment of the interpretability logic of PRA with a constant for I\(\Sigma^1\)

Cites Work

• Unnamed Item
• Unnamed Item
• Modal logics with several operators and probability interpretations
• On the provability logic of bounded arithmetic
• The analytical completeness of Dzhaparidze's polymodal logics
• Fragments of arithmetic
• Self-reference and modal logic
• On the scheme of induction for bounded arithmetic formulas
• Peano's smart children: A provability logical study of systems with built-in consistency
• On bimodal logics of provability
• A smart child of Peano's
• A course on bimodal provability logic
• Provability in finite subtheories of PA and relative interpretability: a modal investigation
• Rosser sentences
• On Rosser's Provability Predicate
• Reflection Principles and their Use for Establishing the Complexity of Axiomatic Systems
• Gödel's Second Theorem for Elementary arithmetic