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

DOI10.1080/11663081.2017.1354498zbMath1398.03093OpenAlexW2738171453MaRDI QIDQ4586217

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

complexitymodal logicfirst-order definabilitymodal definability

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)

Cites Work

• A guide to completeness and complexity for modal logics of knowledge and belief
• The polynomial-time hierarchy
• Model theory
• Algorithmic problems concerning first-order definability of modal formulas on the class of all finite frames
• Epistemology Without Knowledge and Without Belief
• Undecidable problems for modal definability: Table 1.
• Definability Over the Class of all Partitions
• The extensions of the modal logic K5
• The decidability of normal K5 logics
• An undecidable problem in correspondence theory
• Systems for Knowledge and Belief
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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