Hybrid Logics: Characterization, Interpolation and Complexity (1999)
| Venue: | Journal of Symbolic Logic |
| Citations: | 94 - 35 self |
BibTeX
@ARTICLE{Areces99hybridlogics:,
author = {Carlos Areces and Patrick Blackburn and Maarten Marx},
title = {Hybrid Logics: Characterization, Interpolation and Complexity},
journal = {Journal of Symbolic Logic},
year = {1999},
volume = {66},
pages = {2001}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Hybrid languages are expansions of propositional modal languages which can refer to (or even quantify over) worlds. The use of strong hybrid languages dates back to at least [Pri67], but recent work (for example [BS98, BT98a, BT99]) has focussed on a more constrained system called H(#; @). We show in detail that H(#; @) is modally natural. We begin by studying its expressivity, and provide model theoretic characterizations (via a restricted notion of Ehrenfeucht-Frasse game, and an enriched notion of bisimulation) and a syntactic characterization (in terms of bounded formulas). The key result to emerge is that H(#; @) corresponds to the fragment of rst-order logic which is invariant for generated submodels. We then show that H(#; @) enjoys (strong) interpolation, provide counterexamples for its nite variable fragments, and show that weak interpolation holds for the sublanguage H(@). Finally, we provide complexity results for H(@) and other fragments and variants, and sh...
