scientific article; zbMATH DE number 5046366

MaRDI QIDQ5483013zbMATH OpenFDO

Authors Ilya Shapirovsky

Publication date 15 August 2006

zbMATH Keywords

computational complexitymodal logics of Minkowski spacetimetransitive logics

Mathematics Subject Classification ID

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

Recommendations

• PSPACE-decidability of Japaridze's polymodal logic
• PSPACE bounds for rank-1 modal logics
• PSpace reasoning for graded modal logics
• scientific article; zbMATH DE number 1341607
• On the decidability of elementary modal logics
• Modal logics with transitive closure: completeness, decidability, filtration
• Presburger Modal Logic Is PSPACE-Complete
• Decidability of some classes of modal logic
• scientific article; zbMATH DE number 1989649
• Characterizing the NP-PSPACE Gap in the Satisfiability Problem for Modal Logic

Cited in

(11)

• Decidability and complexity of the fragments of the modal logic of Allen's relations over the rationals
• PSPACE bounds for rank-1 modal logics
• PSPACE-decidability of Japaridze's polymodal logic
• THE TEMPORAL LOGIC OF TWO DIMENSIONAL MINKOWSKI SPACETIME IS DECIDABLE
• Temporal logic of Minkowski spacetime
• Satisfiability and model checking for the logic of sub-intervals under the homogeneity assumption
• A note on the complexity of \textbf{S4.2}
• The temporal logic of two-dimensional Minkowski spacetime with slower-than-light accessibility is decidable
• Finite model property of pretransitive analogues of (w)K4 and GL
• The modal logic of abstraction refinement
• Modal logics of some geometrical structures

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 Q5483013)