Complexity of products of modal logics

DOI10.1093/LOGCOM/9.2.197MaRDI QIDQ4242586zbMATH OpenOpenAlexFDO

Authors 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

complexityglobal satisfaction problemlower boundsmodal logicproduct of Kripke framesproduct of modal logicssatisfaction problemtilingupper bounds

Mathematics Subject Classification ID

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

Recommendations

• Products, or how to create modal logics of high complexity
• Products of modal logics, part 1
• Finite frames for \(\mathrm{K4.3} \times \mathrm{S5}\) are decidable
• On axiomatising products of Kripke frames
• On axiomatising products of Kripke frames. II
• Products of modal logics and tensor products of modal algebras
• An elementary construction for a non-elementary procedure
• Products of ‘transitive” modal logics
• Matching topological and frame products of modal logics
• The product of converse PDL and polymodal K

Cited in

(27)

• A decidable temporal logic of parallelism
• The incompleteness of \(\mathrm{S}4\oplus\mathrm{S}4\) for the product space \(\mathbb R\times\mathbb R\)
• Non-primitive recursive decidability of products of modal logics with expanding domains
• Products, or how to create modal logics of high complexity
• Decidable fragments of first-order modal logics
• On satisfiability in ATL with strategy contexts
• The decision problem of modal product logics with a diagonal, and faulty counter machines
• Matching topological and frame products of modal logics
• Products of modal logics with diagonal constant lacking the finite model property
• scientific article; zbMATH DE number 1989655 (Why is no real title available?)
• scientific article; zbMATH DE number 2024635 (Why is no real title available?)
• The product of converse PDL and polymodal K
• On modal logics betweenK × K × KandS5 × S5 × S5
• Undecidability of QLTL and QCTL with two variables and one monadic predicate letter
• Computer Science Logic
• On modal products with the logic of `elsewhere'
• scientific article; zbMATH DE number 2196593 (Why is no real title available?)
• On Product Logic with Truth-constants
• Products of ‘transitive” modal logics
• Complexity of finite-variable fragments of products with K
• Complexity of finite-variable fragments of products with non-transitive modal logics
• The Complexity of Decomposing Modal and First-Order Theories
• Modal logics of succession for 2-dimensional integral spacetime
• Deciding the existence of interpolants and definitions in first-order modal logic
• \({\mathcal E}\)-connections of abstract description systems
• An NP-complete fragment of fibring logic
• Alternative axiomatics and complexity of deliberative STIT theories

This page was built for publication: Complexity of products of modal logics

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