scientific article; zbMATH DE number 5046366

zbMATH Open1102.03020MaRDI QIDQ5483013FDOQ5483013

Authors: Ilya Shapirovsky 

Publication date: 15 August 2006

Title of this publication is not available (Why is that?)

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

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)

Cited In (9)

• PSPACE bounds for rank-1 modal logics
• A note on the complexity of \textbf{S4.2}
• Decidability and complexity of the fragments of the modal logic of Allen's relations over the rationals
• Temporal logic of Minkowski spacetime
• Title not available (Why is that?)
• THE TEMPORAL LOGIC OF TWO DIMENSIONAL MINKOWSKI SPACETIME IS DECIDABLE
• Modal logics of some geometrical structures
• The temporal logic of two-dimensional Minkowski spacetime with slower-than-light accessibility is decidable
• PSPACE-decidability of Japaridze's polymodal logic

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)