Products, or how to create modal logics of high complexity

DOI10.1093/jigpal/9.1.71zbMath0971.03024OpenAlexW2013243527MaRDI QIDQ2708309

Maarten Marx, Szabolcs Mikulás

Publication date: 30 October 2001

Published in: Logic Journal of IGPL (Search for Journal in Brave)

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

zbMATH Keywords

computational complexitydecidabilitysatisfiabilityproducts of modal logics

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15)

Related Items (3)

Alternative axiomatics and complexity of deliberative STIT theories ⋮ Non-primitive recursive decidability of products of modal logics with expanding domains ⋮ The Complexity of Decomposing Modal and First-Order Theories

This page was built for publication: Products, or how to create modal logics of high complexity