Complexity of products of modal logics

DOI10.1093/logcom/9.2.197zbMath0945.03025OpenAlexW1978169673MaRDI QIDQ4242586

Maarten Marx

Publication date: 27 September 2000

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/b3893b1a699620bea3cf61ff2648ca4d10fddcc7

zbMATH Keywords

complexityupper boundsmodal logictilinglower boundsproduct of modal logicsproduct of Kripke framessatisfaction problemglobal satisfaction problem

Mathematics Subject Classification ID

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

Related Items

On modal logics betweenK × K × KandS5 × S5 × S5, The decision problem of modal product logics with a diagonal, and faulty counter machines, Undecidability of QLTL and QCTL with two variables and one monadic predicate letter, On Satisfiability in ATL with Strategy Contexts, A decidable temporal logic of parallelism, An NP-complete fragment of fibring logic, Alternative axiomatics and complexity of deliberative STIT theories, Decidable fragments of first-order modal logics, Modal logics of succession for 2-dimensional integral spacetime, Non-primitive recursive decidability of products of modal logics with expanding domains, The Complexity of Decomposing Modal and First-Order Theories, Products of Modal Logics with Diagonal Constant Lacking the Finite Model Property, \({\mathcal E}\)-connections of abstract description systems