Definability in the class of all KD45-frames -- computability and complexity

DOI10.1080/11663081.2017.1354498MaRDI QIDQ4586217zbMATH OpenOpenAlexFDO

Authors Dimiter T. Georgiev

Publication date 12 September 2018

Published in Journal of Applied Non-Classical Logics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/11663081.2017.1354498

zbMATH Keywords

complexityfirst-order definabilitymodal definabilitymodal logic

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Undecidable problems for modal definability
• Algorithmic problems concerning first-order definability of modal formulas on the class of all finite frames
• A generalization of modal frame definability
• Towards a generalization of modal definability
• Modal correspondence theory in the class of all Euclidean frames

Cites work

• A guide to completeness and complexity for modal logics of knowledge and belief
• Algorithmic problems concerning first-order definability of modal formulas on the class of all finite frames
• An undecidable problem in correspondence theory
• Definability Over the Class of all Partitions
• Demise of the algorithmic agenda in correspondence theory?
• Epistemology without knowledge and without belief
• scientific article; zbMATH DE number 3485746 (Why is no real title available?)
• scientific article; zbMATH DE number 3499717 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 1028833 (Why is no real title available?)
• scientific article; zbMATH DE number 1850738 (Why is no real title available?)
• scientific article; zbMATH DE number 803291 (Why is no real title available?)
• scientific article; zbMATH DE number 824735 (Why is no real title available?)
• scientific article; zbMATH DE number 3248792 (Why is no real title available?)
• Modal logic
• Model theory
• Systems for Knowledge and Belief
• Tableau methods for modal and temporal logics
• The decidability of normal K5 logics
• The extensions of the modal logic K5
• The polynomial-time hierarchy
• The truth about algorithmic problems in correspondence theory
• Undecidable problems for modal definability

Cited in

(7)

• Algorithmic problems concerning first-order definability of modal formulas on the class of all finite frames
• Undecidable problems for modal definability
• Definability Over the Class of all Partitions
• A generalization of modal frame definability
• A recursively enumerable Kripke complete first-order logic not complete with respect to a first-order definable class of frames
• scientific article; zbMATH DE number 5270689 (Why is no real title available?)
• Decidable and Undecidable Problems for First-Order Definability and Modal Definability

This page was built for publication: Definability in the class of all KD45-frames -- computability and complexity

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