The complexity of propositional modal theories and the complexity of consistency of propositional modal theories

DOI10.1007/3-540-58140-5_8MaRDI QIDQ4501138zbMATH OpenFDO

Authors Cheng-Chia Chen, I-Peng Lin

Publication date 3 September 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-58140-5_8

zbMATH Keywords

\(L\)-consistency problem\(L\)-deducibility problemcomputational complexitymodal logicprovabilitysatisfiability

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Complexity of computation (including implicit computational complexity) (03D15)

Recommendations

• Computer Science Logic
• The completeness problem for modal logic
• The computational complexity of the satisfiability of modal Horn clauses for modal propositional logics
• On the complexity of fragments of modal logics
• scientific article; zbMATH DE number 3995647

Cited in

(10)

• Combination of convex theories: modularity, deduction completeness, and explanation
• The effect of bounding the number of primitive propositions and the depth of nesting on the complexity of modal logic
• Computational complexity for bounded distributive lattices with negation
• Complexity of the universal theory of modal algebras
• A modal logic of epistemic games
• Conservative extensions in modal logic
• The Complexity of Decomposing Modal and First-Order Theories
• Frame definability in finitely valued modal logics
• Completing the Picture: Complexity of Graded Modal Logics with Converse
• Alternative axiomatics and complexity of deliberative STIT theories

This page was built for publication: The complexity of propositional modal theories and the complexity of consistency of propositional modal theories

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