Switch to: References

Citations of:

What Are Hybrid Languages?

In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 41-62 (1998)

Add citations

You must login to add citations.
  1. Hybrid Logics: Characterization, Interpolation and Complexity.Carlos Areces, Patrick Blackburn & Maarten Marx - 2001 - Journal of Symbolic Logic 66 (3):977-1010.
    Hybrid languages are expansions of propositional modal languages which can refer to worlds. The use of strong hybrid languages dates back to at least [Pri67], but recent work has focussed on a more constrained system called $\mathscr{H}$. We show in detail that $\mathscr{H}$ is modally natural. We begin by studying its expressivity, and provide model theoretic characterizations and a syntactic characterization. The key result to emerge is that $\mathscr{H}$ corresponds to the fragment of first-order logic which is invariant for generated (...)
    Download  
     
    Export citation  
     
    Bookmark   42 citations  
  • Completeness results for some two-dimensional logics of actuality.David R. Gilbert & Edwin D. Mares - 2012 - Review of Symbolic Logic 5 (2):239-258.
    We provide a Hilbert-style axiomatization of the logic of , as well as a two-dimensional semantics with respect to which our logics are sound and complete. Our completeness results are quite general, pertaining to all such actuality logics that extend a normal and canonical modal basis. We also show that our logics have the strong finite model property and permit straightforward first-order extensions.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Expressive Power of “Now” and “Then” Operators.Igor Yanovich - 2015 - Journal of Logic, Language and Information 24 (1):65-93.
    Natural language provides motivation for studying modal backwards-looking operators such as “now”, “then” and “actually” that evaluate their argument formula at some previously considered point instead of the current one. This paper investigates the expressive power over models of both propositional and first-order basic modal language enriched with such operators. Having defined an appropriate notion of bisimulation for first-order modal logic, I show that backwards-looking operators increase its expressive power quite mildly, contrary to beliefs widespread among philosophers of language and (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Modal logic, truth, and the master modality.Torben Braüner - 2002 - Journal of Philosophical Logic 31 (4):359-386.
    In the paper (Braüner, 2001) we gave a minimal condition for the existence of a homophonic theory of truth for a modal or tense logic. In the present paper we generalise this result to arbitrary modal logics and we also show that a modal logic permits the existence of a homophonic theory of truth if and only if it permits the definition of a socalled master modality. Moreover, we explore a connection between the master modality and hybrid logic: We show (...)
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Essay Review.H. Wansing - 1999 - History and Philosophy of Logic 20 (2):115-120.
    Download  
     
    Export citation  
     
    Bookmark  
  • Complexity of hybrid logics over transitive frames.Martin Mundhenk, Thomas Schneider, Thomas Schwentick & Volker Weber - 2010 - Journal of Applied Logic 8 (4):422-440.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • (1 other version)General Dynamic Dynamic Logic.Patrick Girard, Jeremy Seligman & Fenrong Liu - 1998 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 239-260.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • A bisimulation characterization theorem for hybrid logic with the current-state Binder.Ian Hodkinson & Hicham Tahiri - 2010 - Review of Symbolic Logic 3 (2):247-261.
    We prove that every first-order formula that is invariant under quasi-injective bisimulations is equivalent to a formula of the hybrid logic . Our proof uses a variation of the usual unravelling technique. We also briefly survey related results, and show in a standard way that it is undecidable whether a first-order formula is invariant under quasi-injective bisimulations.
    Download  
     
    Export citation  
     
    Bookmark