Undecidability of Multi-modal Hybrid Logics

Authors:
Martin Mundhenk;Thomas Schneider
Affiliations:
Institut für Informatik, Friedrich-Schiller-Universität, Jena, Germany;Institut für Informatik, Friedrich-Schiller-Universität, Jena, Germany
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2007

Citing 3
Cited 1

A guide to completeness and complexity for modal logics of knowledge and belief

Artificial Intelligence
Transfer Results for Hybrid Logic. Part I: The Case Without Satisfaction Operators

Journal of Logic and Computation
On the complexity of hybrid logics with binders

CSL'05 Proceedings of the 19th international conference on Computer Science Logic

A proof procedure for hybrid logic with binders, transitivity and relation hierarchies

CADE'13 Proceedings of the 24th international conference on Automated Deduction

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper establishes undecidability of satisfiability for multi-modal logic equipped with the hybrid binder @7, with respect to frame classes over which the same language with only one modality is decidable. This is in contrast to the usual behaviour of many modal and hybrid logics, whose uni-modal and multi-modal versions do not differ in terms of decidability and, quite often, complexity. The results from this paper apply to a wide range of frame classes including temporally and epistemically relevant ones.