Name
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. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1016/j.entcs.2006.11.024 | Electr. Notes Theor. Comput. Sci. |
Keywords | Field | DocType |
modal logic,multi-modal hybrid logics,multi-modal logic,downarrow operator,computational complexity,multi-modal version,usual behaviour,hybrid binder,hybrid logic,wide range,frame class,satisfiability | Hybrid logic,Discrete mathematics,Accessibility relation,Normal modal logic,Computer science,Satisfiability,Multimodal logic,Theoretical computer science,Decidability,Modal logic,Modal | Journal |
Volume | Issue | ISSN |
174 | 6 | Electronic Notes in Theoretical Computer Science |
Citations | PageRank | References |
6 | 0.47 | 15 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Martin Mundhenk | 1 | 23 | 2.95 |
| Thomas Schneider | 2 | 55 | 6.54 |