Undecidable properties of extensions of provability logic. II

DOI10.1007/BF02215288MaRDI QIDQ805607zbMATH OpenOpenAlexFDO

Authors Alexander Vasil'evich Chagrov

Publication date 1990

Published in Algebra and Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02215288

zbMATH Keywords

Minski maschinemodal logics which extend the Gödel-Löb system GL

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Modal logic (including the logic of norms) (03B45) Undecidability and degrees of sets of sentences (03D35) Gödel numberings and issues of incompleteness (03F40)

Review text

[For part I see Algebra Logika 29, No.3, 350-367 (1990; Zbl 0723.03005).] The aim of this paper is to study questions of effective recognition of properties of modal logics which extend the Gödel-Löb system GL. Using some uniform emulation method for the working of a Minski maschine in modal propositional logic, the author shows that the following properties: a) to be Kripke-complete, b) to be the modal counterpart of Int, c) to be closed with respect to the Gödel normalization rule, d) to be Halldén-complete, are undecidable. By the way, some interesting results of other kinds are obtained. For instance that there are \(2^{\omega}\) maximal logics among the modal counterparts of Int extending the logic S.

Recommendations

• Undecidable properties of extensions of the logic of provability
• The undecidability of the disjunction property of propositional logics and other related problems
• Insolubility of Gödel-Löb logic with quantifiers of propositional variables
• scientific article; zbMATH DE number 850397
• scientific article; zbMATH DE number 3963790

Cites work

• scientific article; zbMATH DE number 4047685 (Why is no real title available?)
• scientific article; zbMATH DE number 3639591 (Why is no real title available?)
• On systems of modal logic with provability interpretations
• Post Completeness and Free Algebras
• Undecidable properties of extensions of the logic of provability
• Varieties of logical matrices

Cited in

(22)

• Maximality in modal logic
• The disjunction property of intermediate propositional logics
• Modal companions of intermediate propositional logics
• Undecidability results on two-variable logics
• Insolubility of Gödel-Löb logic with quantifiers of propositional variables
• Strong computability of slices over the logic GL
• Undecidability of a second-order provability logic with operation of comparison of witnesses
• Algorithmic problems concerning first-order definability of modal formulas on the class of all finite frames
• Restricted interpolation over modal logic S4
• Undecidable iterative propositional calculus
• scientific article; zbMATH DE number 6602207 (Why is no real title available?)
• scientific article; zbMATH DE number 4212005 (Why is no real title available?)
• scientific article; zbMATH DE number 4168652 (Why is no real title available?)
• The undecidability of the disjunction property of propositional logics and other related problems
• scientific article; zbMATH DE number 850397 (Why is no real title available?)
• Undecidability of the Logic of Partial Quasiary Predicates
• COMPLETE ADDITIVITY AND MODAL INCOMPLETENESS
• Remarks on natural minimal logics: A. Visser's basic and formal logics and their modal counterparts
• Processes, Terms and Cycles: Steps on the Road to Infinity
• Undecidable properties of extensions of the logic of provability
• Proof analysis in modal logic
• Recognizable logics

This page was built for publication: Undecidable properties of extensions of provability logic. II

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q805607)