PSPACE bounds for rank-1 modal logics
From MaRDI portal
Publication:2946571
DOI10.1145/1462179.1462185zbMath1351.03015arXiv0706.4044OpenAlexW2250074872MaRDI QIDQ2946571
Publication date: 17 September 2015
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0706.4044
Analysis of algorithms and problem complexity (68Q25) Modal logic (including the logic of norms) (03B45) Categorical logic, topoi (03G30)
Related Items
On Composing Finite Forests with Modal Logics ⋮ Free Heyting Algebras: Revisited ⋮ The Temporal Logic of Coalitional Goal Assignments in Concurrent Multiplayer Games ⋮ Reasoning with Global Assumptions in Arithmetic Modal Logics ⋮ Cut elimination in coalgebraic logics ⋮ Hybrid logic with the difference modality for generalisations of graphs ⋮ Coalgebraic semantics of modal logics: an overview ⋮ Completeness for \(\mu\)-calculi: a coalgebraic approach ⋮ Modular algorithms for heterogeneous modal logics via multi-sorted coalgebra ⋮ Cut Elimination for Shallow Modal Logics ⋮ Completeness for the modal \(\mu\)-calculus: separating the combinatorics from the dynamics ⋮ Global Caching for Coalgebraic Description Logics ⋮ Coalgebraic Hybrid Logic ⋮ Coalgebraic logics \& duality ⋮ EXPTIME Tableaux for the Coalgebraic μ-Calculus ⋮ Sequent Calculi and Interpolation for Non-Normal Modal and Deontic Logics
