The undecidability of the disjunction property of propositional logics and other related problems

DOI10.2307/2275108zbMath0799.03009OpenAlexW1997708236MaRDI QIDQ4276033

Michael Zakharyashchev, Alexander Chagrov

Publication date: 26 January 1994

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

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

zbMATH Keywords

undecidabilitydecidabilityfinite model propertydisjunction propertyaxiomatizabilitypropositional modal logicintermediate logicHalldén-completenesscanonical formulaMaksimova-completenesssimulating Minsky machines in Kripke models

Mathematics Subject Classification ID

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

Related Items (11)

A new solution to a problem of Hosoi and Ono ⋮ On variable separation in modal and superintuitionistic logics ⋮ Algorithmic problems concerning first-order definability of modal formulas on the class of all finite frames ⋮ Canonical formulas for a paraconsistent analog of the Scott logic ⋮ Canonical formulas for K4. Part II: Cofinal subframe logics ⋮ Undecidability of the problem of recognizing axiomatizations of superintuitionistic propositional calculi ⋮ A syntactic approach to Maksimova's principle of variable separation for some substructural logics ⋮ Canonical varieties with no canonical axiomatisation ⋮ A Generalization of Maksimova’s Criterion for the Disjunction Property ⋮ KRIPKE COMPLETENESS OF STRICTLY POSITIVE MODAL LOGICS OVER MEET-SEMILATTICES WITH OPERATORS ⋮ COMPLETE ADDITIVITY AND MODAL INCOMPLETENESS

Cites Work

• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• Intermediate logics with the same disjunctionless fragment as intuitionistic logic
• On maximal intermediate logics with the disjunction property
• Interpolation properties of superintuitionistic logics
• Hallden-completeness by gluing of Kripke frames
• The disjunction property of intermediate propositional logics
• Modal companions of intermediate propositional logics
• Some results on the intermediate logics
• Eine Unableitbarkeitsbeweismethode für den Intuitionistischen Aussagenkalkül
• Logics containing K4. Part II
• On formulas of one variable in intuitionistic propositional calculus
• An undecidable problem in correspondence theory
• Canonical formulas for K4. Part I: Basic results
• A sequence of decidable finitely axiomatizable intermediate logics with the disjunction property
• The decidability of certain intermediate propositional logics
• Modal Logics Between S 4 and S 5
• Superconstructive Propositional Calculi with Extra Axiom Schemes Containing One Variable

This page was built for publication: The undecidability of the disjunction property of propositional logics and other related problems