Switch to: References

Add citations

You must login to add citations.
  1. Reichenbach, Prior and Hybrid Tense Logic.Patrick Blackburn & Klaus Frovin Jørgensen - 2016 - Synthese 193 (11):3677-3689.
    In this paper we argue that Prior and Reichenbach are best viewed as allies, not antagonists. We do so by combining the central insights of Prior and Reichenbach in the framework of hybrid tense logic. This overcomes a well-known defect of Reichenbach’s tense schema, namely that it gives multiple representations to sentences in the future perfect and the future-in-the-past. It also makes it easy to define an iterative schema for tense that allows for multiple points of reference, a possibility noted (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Deciding Regular Grammar Logics with Converse Through First-Order Logic.Stéphane Demri & Hans De Nivelle - 2005 - Journal of Logic, Language and Information 14 (3):289-329.
    We provide a simple translation of the satisfiability problem for regular grammar logics with converse into GF2, which is the intersection of the guarded fragment and the 2-variable fragment of first-order logic. The translation is theoretically interesting because it translates modal logics with certain frame conditions into first-order logic, without explicitly expressing the frame conditions. It is practically relevant because it makes it possible to use a decision procedure for the guarded fragment in order to decide regular grammar logics with (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • The Complexity of Monotone Hybrid Logics Over Linear Frames and the Natural Numbers.Stefan Göller, Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas & Felix Weiß - 2012 - In Thomas Bolander, Torben Braüner, Silvio Ghilardi & Lawrence Moss (eds.), Advances in Modal Logic, Volume 9. CSLI Publications. pp. 261-278.
    Download  
     
    Export citation  
     
    Bookmark  
  • Topology, Connectedness, and Modal Logic.Roman Kontchakov, Ian Pratt-Hartmann, Frank Wolter & Michael Zakharyaschev - 2008 - In Carlos Areces & Robert Goldblatt (eds.), Advances in Modal Logic, Volume 7. CSLI Publications. pp. 151-176.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • 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  
  • The Complexity of Satisfiability for Fragments of Hybrid Logic—Part I.Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Volker Weber & Felix Weiss - 2010 - Journal of Applied Logic 8 (4):409-421.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • The Complexity of Hybrid Logics Over Equivalence Relations.Martin Mundhenk & Thomas Schneider - 2009 - Journal of Logic, Language and Information 18 (4):493-514.
    This paper examines and classifies the computational complexity of model checking and satisfiability for hybrid logics over frames with equivalence relations. The considered languages contain all possible combinations of the downarrow binder, the existential binder, the satisfaction operator, and the global modality, ranging from the minimal hybrid language to very expressive languages. For model checking, we separate polynomial-time solvable from PSPACE-complete cases, and for satisfiability, we exhibit cases complete for NP, PS pace , NE xp T ime , and even (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • General Dynamic Dynamic Logic.Patrick Girard, Jeremy Seligman & Fenrong Liu - 2012 - In Thomas Bolander, Torben Braüner, Silvio Ghilardi & Lawrence Moss (eds.), Advances in Modal Logic, Volume 9. CSLI Publications. pp. 239-260.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Discrete Linear Temporal Logic with Current Time Point Clusters, Deciding Algorithms.V. Rybakov - 2008 - Logic and Logical Philosophy 17 (1-2):143-161.
    The paper studies the logic TL(NBox+-wC) – logic of discrete linear time with current time point clusters. Its language uses modalities Diamond+ (possible in future) and Diamond- (possible in past) and special temporal operations, – Box+w (weakly necessary in future) and Box-w (weakly necessary in past). We proceed by developing an algorithm recognizing theorems of TL(NBox+-wC), so we prove that TL(NBox+-wC) is decidable. The algorithm is based on reduction of formulas to inference rules and converting the rules in special reduced (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Modal Hybrid Logic.Andrzej Indrzejczak - 2007 - Logic and Logical Philosophy 16 (2-3):147-257.
    This is an extended version of the lectures given during the 12-thConference on Applications of Logic in Philosophy and in the Foundationsof Mathematics in Szklarska Poręba. It contains a surveyof modal hybrid logic, one of the branches of contemporary modal logic. Inthe first part a variety of hybrid languages and logics is presented with adiscussion of expressivity matters. The second part is devoted to thoroughexposition of proof methods for hybrid logics. The main point is to showthat application of hybrid logics (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Algorithmic Correspondence and Completeness in Modal Logic. IV. Semantic Extensions of SQEMA.Willem Conradie & Valentin Goranko - 2008 - Journal of Applied Non-Classical Logics 18 (2-3):175-211.
    In a previous work we introduced the algorithm \SQEMA\ for computing first-order equivalents and proving canonicity of modal formulae, and thus established a very general correspondence and canonical completeness result. \SQEMA\ is based on transformation rules, the most important of which employs a modal version of a result by Ackermann that enables elimination of an existentially quantified predicate variable in a formula, provided a certain negative polarity condition on that variable is satisfied. In this paper we develop several extensions of (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Hybrid Logics of Separation Axioms.Dmitry Sustretov - 2009 - Journal of Logic, Language and Information 18 (4):541-558.
    We study hybrid logics in topological semantics. We prove that hybrid logics of separation axioms are complete with respect to certain classes of finite topological models. This characterisation allows us to obtain several further results. We prove that aforementioned logics are decidable and PSPACE-complete, the logics of T 1 and T 2 coincide, the logic of T 1 is complete with respect to two concrete structures: the Cantor space and the rational numbers.
    Download  
     
    Export citation  
     
    Bookmark  
  • Model Checking for Hybrid Logic.Martin Lange - 2009 - Journal of Logic, Language and Information 18 (4):465-491.
    We consider the model checking problem for Hybrid Logic. Known algorithms so far are global in the sense that they compute, inductively, in every step the set of all worlds of a Kripke structure that satisfy a subformula of the input. Hence, they always exploit the entire structure. Local model checking tries to avoid this by only traversing necessary parts of the input in order to establish or refute the satisfaction relation between a given world and a formula. We present (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Guarded Fragments with Constants.Balder ten Cate & Massimo Franceschet - 2005 - Journal of Logic, Language and Information 14 (3):281-288.
    We prove ExpTime-membership of the satisfiability problem for loosely ∀-guarded first-order formulas with a bounded number of variables and an unbounded number of constants. Guarded fragments with constants are interesting by themselves and because of their connection to hybrid logic.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • 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   28 citations  
  • The Expressive Power of Memory Logics.Carlos Areces, Diego Figueira, Santiago Figueira & Sergio Mera - 2011 - Review of Symbolic Logic 4 (2):290-318.
    We investigate the expressive power of memory logics. These are modal logics extended with the possibility to store (or remove) the current node of evaluation in (or from) a memory, and to perform membership tests on the current memory. From this perspective, the hybrid logic (↓), for example, can be thought of as a particular case of a memory logic where the memory is an indexed list of elements of the domain.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Model Checking Hybrid Logics.Massimo Franceschet & Maarten de Rijke - 2006 - Journal of Applied Logic 4 (3):279-304.
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Using Modal Logics to Express and Check Global Graph Properties.Mario Benevides & L. Schechter - 2009 - Logic Journal of the IGPL 17 (5):559-587.
    Graphs are among the most frequently used structures in Computer Science. Some of the properties that must be checked in many applications are connectivity, acyclicity and the Eulerian and Hamiltonian properties. In this work, we analyze how we can express these four properties with modal logics. This involves two issues: whether each of the modal languages under consideration has enough expressive power to describe these properties and how complex it is to use these logics to actually test whether a given (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • The Many Faces of Counts-As: A Formal Analysis of Constitutive Rules.Davide Grossi, John-Jules Ch Meyer & Frank Dignum - 2008 - Journal of Applied Logic 6 (2):192-217.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • The Expressibility of Fragments of Hybrid Graph Logic on Finite Digraphs.James Gate & Iain A. Stewart - 2013 - Journal of Applied Logic 11 (3):272-288.
    Download  
     
    Export citation  
     
    Bookmark  
  • A Logic for Metric and Topology.Frank Wolter & Michael Zakharyaschev - 2005 - Journal of Symbolic Logic 70 (3):795 - 828.
    We propose a logic for reasoning about metric spaces with the induced topologies. It combines the 'qualitative' interior and closure operators with 'quantitative' operators 'somewhere in the sphere of radius r.' including or excluding the boundary. We supply the logic with both the intended metric space semantics and a natural relational semantics, and show that the latter (i) provides finite partial representations of (in general) infinite metric models and (ii) reduces the standard '∈-definitions' of closure and interior to simple constraints (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations