The truth about algorithmic problems in correspondence theory

MaRDI QIDQ3509049zbMATH OpenFDO

Authors L.A.Chagrova, Alexander Vasil'evich Chagrov

Publication date 1 July 2008

zbMATH Keywords

algorithmic problemscorrespondence theoryfirst-order definabilityKripke framesmodal definabilitymodal logicundecidability

Mathematics Subject Classification ID

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

Recommendations

• Demise of the algorithmic agenda in correspondence theory?
• An undecidable problem in correspondence theory
• Modal logics definable by universal three-variable formulas
• Algorithmic problems concerning first-order definability of modal formulas on the class of all finite frames
• Undecidable problems for modal definability

Cited in

(21)

• Algorithmic problems concerning first-order definability of modal formulas on the class of all finite frames
• Algorithmic correspondence and canonicity for non-distributive logics
• Algebraic modal correspondence: Sahlqvist and beyond
• Modal definability of first-order formulas with free variables and query answering
• Undecidable problems for modal definability
• scientific article; zbMATH DE number 4066342 (Why is no real title available?)
• An undecidable problem in correspondence theory
• Algorithmic correspondence and canonicity for distributive modal logic
• The Ackermann approach for modal logic, correspondence theory and second-order reduction
• Definability in the class of all KD45-frames -- computability and complexity
• Modal correspondence theory in the class of all Euclidean frames
• A dichotomy for some elementarily generated modal logics
• Kripke completeness of strictly positive modal logics over meet-semilattices with operators
• Correspondence theory in proof theory
• Demise of the algorithmic agenda in correspondence theory?
• scientific article; zbMATH DE number 2209455 (Why is no real title available?)
• Boolean logics with relations
• Decidable and Undecidable Problems for First-Order Definability and Modal Definability
• Parametrized modal logic. II: The unidimensional case
• Correspondence problems for classes of postlinear orders
• Intuitionistic epistemic logic with two modal operators

This page was built for publication: The truth about algorithmic problems in correspondence theory

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