scientific article; zbMATH DE number 1499085
From MaRDI portal
Publication:4501138
zbMATH Open0946.03021MaRDI QIDQ4501138FDOQ4501138
Authors: Cheng-Chia Chen, I-Peng Lin
Publication date: 3 September 2000
Title of this publication is not available (Why is that?)
Recommendations
computational complexitymodal logicsatisfiabilityprovability\(L\)-consistency problem\(L\)-deducibility problem
Modal logic (including the logic of norms) (03B45) Complexity of computation (including implicit computational complexity) (03D15)
Cited In (10)
- Complexity of the universal theory of modal algebras
- Alternative axiomatics and complexity of deliberative STIT theories
- Frame definability in finitely valued modal logics
- Conservative extensions in modal logic
- Computational complexity for bounded distributive lattices with negation
- Completing the Picture: Complexity of Graded Modal Logics with Converse
- A modal logic of epistemic games
- The Complexity of Decomposing Modal and First-Order Theories
- The effect of bounding the number of primitive propositions and the depth of nesting on the complexity of modal logic
- Combination of convex theories: modularity, deduction completeness, and explanation
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4501138)