Undecidable properties of extensions of the logic of provability

DOI10.1007/BF01979939zbMath0723.03005MaRDI QIDQ757339

Alexander Chagrov

Publication date: 1990

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

zbMATH Keywords

decidabilityfinite model propertydisjunction propertymodal logicsinterpolation propertyextensions of provability logicMinski machines

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Undecidability and degrees of sets of sentences (03D35)

Related Items

Algorithmic problems concerning first-order definability of modal formulas on the class of all finite frames, Interpolation properties in the extensions of the logic of inequality, Weak interpolation in extensions of the logics S4 and K4, Decidability of the interpolation problem and of related properties in tabular logics, Definability and interpolation in non-classical logics, Decidability of Some Interpolation Properties for Weakly Transitive Modal Logics, Undecidable properties of extensions of provability logic. II

Cites Work

• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• Varieties of logical matrices
• Post Completeness and Free Algebras
• A finitely axiomatizable undecidable extension of K
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item