Hybrid logics: Characterization, interpolation and complexity

Journal of Symbolic Logic 66 (3):977-1010 (2001)
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 $\mathscr{H}(\downarrow, @)$ . We show in detail that $\mathscr{H}(\downarrow, @)$ is modally natural. We begin by studying its expressivity, and provide model theoretic characterizations (via a restricted notion of Ehrenfeucht-Fraisse game, and an enriched notion of bisimulation) and a syntactic characterization (in terms of bounded formulas). The key result to emerge is that $\mathscr{H}(\downarrow, @)$ corresponds to the fragment of first-order logic which is invariant for generated submodels. We then show that $\mathscr{H}(\downarrow, @)$ enjoys (strong) interpolation, provide counterexamples for its finite 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 sharpen known undecidability results for $\mathscr{H}(\downarrow, @)$
Keywords No keywords specified (fix it)
Categories (categorize this paper)
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
 
Download options
PhilPapers Archive


Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 11,371
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

No references found.

Citations of this work BETA
Tero Tulenheimo (2009). Hybrid Logic Meets If Modal Logic. Journal of Logic, Language and Information 18 (4):559-591.
Volker Weber (2009). Branching-Time Logics Repeatedly Referring to States. Journal of Logic, Language and Information 18 (4):593-624.

View all 8 citations

Similar books and articles
Analytics

Monthly downloads

Added to index

2009-01-28

Total downloads

3 ( #297,594 of 1,102,832 )

Recent downloads (6 months)

3 ( #120,475 of 1,102,832 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Start a new thread
Order:
There  are no threads in this forum
Nothing in this forum yet.