Undecidability of Multi-modal Hybrid Logics
From MaRDI portal
Publication:2867946
DOI10.1016/J.ENTCS.2006.11.024zbMath1278.03047OpenAlexW1999165408MaRDI QIDQ2867946
Martin Mundhenk, Thomas Schneider
Publication date: 20 December 2013
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2006.11.024
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 (4)
Complexity of hybrid logics over transitive frames ⋮ A prover dealing with nominals, binders, transitivity and relation hierarchies ⋮ Undecidability of Multi-modal Hybrid Logics ⋮ Testing XML constraint satisfiability
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Complexity of hybrid logics over transitive frames
- On the size of refutation Kripke models for some linear modal and tense logics
- A guide to completeness and complexity for modal logics of knowledge and belief
- Hybrid languages
- Undecidability of Multi-modal Hybrid Logics
- The Computational Complexity of Provability in Systems of Modal Propositional Logic
- Representation, reasoning, and relational structures: a hybrid logic manifesto
- The computational complexity of hybrid temporal logics
- Computer Science Logic
- Transfer Results for Hybrid Logic. Part I: The Case Without Satisfaction Operators
- The undecidability of the domino problem
This page was built for publication: Undecidability of Multi-modal Hybrid Logics