Switch to: Citations

Add references

You must login to add references.
  1. Hierarchies of modal and temporal logics with reference pointers.Valentin Goranko - 1996 - Journal of Logic, Language and Information 5 (1):1-24.
    We introduce and study hierarchies of extensions of the propositional modal and temporal languages with pairs of new syntactic devices: point of reference-reference pointer which enable semantic references to be made within a formula. We propose three different but equivalent semantics for the extended languages, discuss and compare their expressiveness. The languages with reference pointers are shown to have great expressive power (especially when their frugal syntax is taken into account), perspicuous semantics, and simple deductive systems. For instance, Kamp's and (...)
    Download  
     
    Export citation  
     
    Bookmark   26 citations  
  • Hybrid languages.Patrick Blackburn & Jerry Seligman - 1995 - Journal of Logic, Language and Information 4 (3):251-272.
    Hybrid languages have both modal and first-order characteristics: a Kripke semantics, and explicit variable binding apparatus. This paper motivates the development of hybrid languages, sketches their history, and examines the expressive power of three hybrid binders. We show that all three binders give rise to languages strictly weaker than the corresponding first-order language, that full first-order expressivity can be gained by adding the universal modality, and that all three binders can force the existence of infinite models and have undecidable satisfiability (...)
    Download  
     
    Export citation  
     
    Bookmark   46 citations  
  • The computational complexity of hybrid temporal logics.C. Areces, P. Blackburn & M. Marx - 2000 - Logic Journal of the IGPL 8 (5):653-679.
    In their simplest form, hybrid languages are propositional modal languages which can refer to states. They were introduced by Arthur Prior, the inventor of tense logic, and played an important role in his work: because they make reference to specific times possible, they remove the most serious obstacle to developing modal approaches to temporal representation and reasoning. However very little is known about the computational complexity of hybrid temporal logics.In this paper we analyze the complexity of the satisfiability problem of (...)
    Download  
     
    Export citation  
     
    Bookmark   28 citations  
  • 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  
  • What Are Hybrid Languages?Patrick Blackburn & Jerry Seligman - 1998 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 41-62.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • A Lower Complexity Bound for Propositional Dynamic Logic with Intersection.M. Lange - 1998 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 133-147.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • A Lower Complexity Bound for Propositional Dynamic Logic with Intersection.M. Lange - 1998 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 133-147.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Model checking hybrid logics.Massimo Franceschet & Maarten de Rijke - 2006 - Journal of Applied Logic 4 (3):279-304.
    Download  
     
    Export citation  
     
    Bookmark   9 citations