Journal of Symbolic Logic · 2001 · 213 citations · 20 references
HumanitiesComputer ScienceMathematicsLogicSyntaxTheory Of ComputationFirst-order LogicModal LogicModal SemanticsModel TheoryBisimulation In LogicComplexityEhrenfeucht-fraïssé GamesHybrid LogicHybrid LogicsModel-theoretic SemanticsStrong BisimulationUndecidability
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 (↓, @) is modally natural. We begin by studying its expressivity, and provide model theoretic characterizations (via a restricted notion of Ehrenfeucht-Fraïssé game, and an enriched notion of bisimulation) and a syntactic characterization (in terms of bounded formulas). The key result to emerge is that (↓, @) corresponds to the fragment of first-order logic which is invariant for generated submodels. We then show that (↓, @) enjoys (strong) interpolation, provide counterexamples for its finite variable fragments, and show that weak interpolation holds for the sublanguage (@). Finally, we provide complexity results for (@) and other fragments and variants, and sharpen known undecidability results for (↓, @).
20
J. C. C. McKinsey, Hans Reichenbach · American Mathematical Monthly · 1948 · 2.3K citations
Brian Coffey · The Modern Schoolman · 1948 · 606 citations