On bimodal logics of provability

DOI10.1016/0168-0072(94)90071-XzbMath0814.03010MaRDI QIDQ1332858

Lev D. Beklemishev

Publication date: 13 October 1994

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-0072(94)90071-x

zbMATH Keywords

Kripke semantics; provability logic; complete axiomatization; decision procedures; bimodal logics; Kalmar elementary arithmetic

Mathematics Subject Classification ID

03B45: Modal logic (including the logic of norms)

03F30: First-order arithmetic and fragments

Related Items

Undecidability in diagonalizable algebras, Bimodal logics for extensions of arithmetical theories, Solutions to the knower paradox in the light of Haack's criteria, Iterated local reflection versus iterated consistency

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Modal logics with several operators and probability interpretations
• Provability logics for natural Turing progressions of arithmetical theories
• The provability logics of recursively enumerable theories extending Peano arithmetic at arbitrary theories extending Peano arithmetic
• Self-reference and modal logic
• The formalization of interpretability
• Independent numerations of theories and recursive progressions
• Provability interpretations of modal logic
• Extension of an effectively generated class of functions by enumeration
• Arithmetization of metamathematics in a general setting
• ON THE CLASSIFICATION OF PROPOSITIONAL PROVABILITY LOGICS
• Provability in finite subtheories of PA and relative interpretability: a modal investigation
• Built-up systems of fundamental sequences and hierarchies of number-theoretic functions
• Transfinite recursive progressions of axiomatic theories
• Systems of Logic Based on Ordinals^†