Undecidability of multi-modal hybrid logics

DOI10.1016/J.ENTCS.2006.11.024zbMATH Open1278.03047OpenAlexW1999165408MaRDI QIDQ2867946FDOQ2867946

Authors: 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

Recommendations

• The Complexity of Satisfiability for Fragments of Hybrid Logic—Part I
• The complexity of satisfiability for fragments of hybrid logic. I.
• A Universally Defined Undecidable Unimodal Logic
• Computer Science Logic
• Complexity of hybrid logics over transitive frames

zbMATH Keywords

computational complexitymodal logichybrid logicdownarrow operator

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Computer Science Logic
• The undecidability of the domino problem
• Hybrid languages
• Title not available (Why is that?)
• A guide to completeness and complexity for modal logics of knowledge and belief
• The Computational Complexity of Provability in Systems of Modal Propositional Logic
• Representation, reasoning, and relational structures: a hybrid logic manifesto
• Title not available (Why is that?)
• The computational complexity of hybrid temporal logics
• Transfer Results for Hybrid Logic. Part I: The Case Without Satisfaction Operators
• Algebraic and model theoretic techniques for fusion decidability in modal logics
• On the size of refutation Kripke models for some linear modal and tense logics
• Undecidability of multi-modal hybrid logics
• Complexity of hybrid logics over transitive frames
• Title not available (Why is that?)

Cited In (11)

• Undecidability of multi-modal hybrid logics
• A Universally Defined Undecidable Unimodal Logic
• Complexity of hybrid logics over transitive frames
• The price of universality
• Expressive Power and Decidability for Memory Logics
• Title not available (Why is that?)
• Narcissists are easy, stepmothers are hard
• A prover dealing with nominals, binders, transitivity and relation hierarchies
• Testing XML constraint satisfiability
• On the undecidability of logics with converse, nominals, recursion and counting
• Highway to the Danger Zone

This page was built for publication: Undecidability of multi-modal hybrid logics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2867946)