Switch to: References

Add citations

You must login to add citations.
  1. Modal Logics for Parallelism, Orthogonality, and Affine Geometries.Philippe Balbiani & Valentin Goranko - 2002 - Journal of Applied Non-Classical Logics 12 (3-4):365-397.
    We introduce and study a variety of modal logics of parallelism, orthogonality, and affine geometries, for which we establish several completeness, decidability and complexity results and state a number of related open, and apparently difficult problems. We also demonstrate that lack of the finite model property of modal logics for sufficiently rich affine or projective geometries (incl. the real affine and projective planes) is a rather common phenomenon.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Computation Tree Logics and Temporal Logics with Reference Pointers.Valentin Goranko - 2000 - Journal of Applied Non-Classical Logics 10 (3-4):221-242.
    A complete axiomatic system CTL$_{rp}$ is introduced for a temporal logic for finitely branching $\omega^+$-trees in a temporal language extended with so called reference pointers. Syntactic and semantic interpretations are constructed for the branching time computation tree logic CTL* into CTL$_{rp}$. In particular, that yields a complete axiomatization for the translations of all valid CTL*-formulae. Thus, the temporal logic with reference pointers is brought forward as a simpler (with no path quantifiers), but in a way more expressive medium for reasoning (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Arthur Prior and ‘Now’.Patrick Blackburn & Klaus Frovin Jørgensen - 2016 - Synthese 193 (11).
    On the 4th of December 1967, Hans Kamp sent his UCLA seminar notes on the logic of ‘now’ to Arthur N. Prior. Kamp’s two-dimensional analysis stimulated Prior to an intense burst of creativity in which he sought to integrate Kamp’s work into tense logic using a one-dimensional approach. Prior’s search led him through the work of Castañeda, and back to his own work on hybrid logic: the first made temporal reference philosophically respectable, the second made it technically feasible in a (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • On the Modal Logic of Subset and Superset: Tense Logic Over Medvedev Frames.Wesley H. Holliday - 2017 - Studia Logica 105 (1):13-35.
    Viewing the language of modal logic as a language for describing directed graphs, a natural type of directed graph to study modally is one where the nodes are sets and the edge relation is the subset or superset relation. A well-known example from the literature on intuitionistic logic is the class of Medvedev frames $\langle W,R\rangle$ where $W$ is the set of nonempty subsets of some nonempty finite set $S$, and $xRy$ iff $x\supseteq y$, or more liberally, where $\langle W,R\rangle$ (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Completeness in Hybrid Type Theory.Carlos Areces, Patrick Blackburn, Antonia Huertas & María Manzano - 2014 - Journal of Philosophical Logic 43 (2-3):209-238.
    We show that basic hybridization makes it possible to give straightforward Henkin-style completeness proofs even when the modal logic being hybridized is higher-order. The key ideas are to add nominals as expressions of type t, and to extend to arbitrary types the way we interpret \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$@_i$\end{document} in propositional and first-order hybrid logic. This means: interpret \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$@_i\alpha _a$\end{document}, where \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • A Modal Perspective on the Computational Complexity of Attribute Value Grammar.Patrick Blackburn & Edith Spaan - 1993 - Journal of Logic, Language and Information 2 (2):129-169.
    Many of the formalisms used in Attribute Value grammar are notational variants of languages of propositional modal logic, and testing whether two Attribute Value Structures unify amounts to testing for modal satisfiability. In this paper we put this observation to work. We study the complexity of the satisfiability problem for nine modal languages which mirror different aspects of AVS description formalisms, including the ability to express re-entrancy, the ability to express generalisations, and the ability to express recursive constraints. Two main (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Propositional Q-Logic.Stefan Wölfl - 2002 - Journal of Philosophical Logic 31 (5):387-414.
    Topic of the paper is Q-logic - a logic of agency in its temporal and modal context. Q-logic may be considered as a basal logic of agency since the most important stitoperators discussed in the literature can be defined or axiomatized easily within its semantical and syntactical framework. Its basic agent dependent operator, the Q-operator (also known as Δ- or cstit-operator), which has been discussed independently by E v. Kutschera and B. E Chellas, is investigated here in respect of its (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Temporal Reference in Linear Tense Logic.M. J. Cresswell - 2010 - Journal of Philosophical Logic 39 (2):173-200.
    The paper introduces a first-order theory in the language of predicate tense logic which contains a single simple axiom. It is shewn that this theory enables times to be referred to and sentences involving ‘now’ and ‘then’ to be formalised. The paper then compares this way of increasing the expressive capacity of predicate tense logic with other mechanisms, and indicates how to generalise the results to other modal and tense systems.
    Download  
     
    Export citation  
     
    Bookmark   3 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  
  • Proof-Theoretic Functional Completeness for the Hybrid Logics of Everywhere and Elsewhere.Torben Braüner - 2005 - Studia Logica 81 (2):191-226.
    A hybrid logic is obtained by adding to an ordinary modal logic further expressive power in the form of a second sort of propositional symbols called nominals and by adding so-called satisfaction operators. In this paper we consider hybridized versions of S5 (“the logic of everywhere”) and the modal logic of inequality (“the logic of elsewhere”). We give natural deduction systems for the logics and we prove functional completeness results.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Pure Extensions, Proof Rules, and Hybrid Axiomatics.Patrick Blackburn & Balder Ten Cate - 2006 - Studia Logica 84 (2):277-322.
    In this paper we argue that hybrid logic is the deductive setting most natural for Kripke semantics. We do so by investigating hybrid axiomatics for a variety of systems, ranging from the basic hybrid language to the strong Priorean language . We show that hybrid logic offers a genuinely first-order perspective on Kripke semantics: it is possible to define base logics which extend automatically to a wide variety of frame classes and to prove completeness using the Henkin method. In the (...)
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Simulation and Transfer Results in Modal Logic – a Survey.Marcus Kracht & Frank Wolter - 1997 - Studia Logica 59 (2):149-177.
    This papers gives a survey of recent results about simulations of one class of modal logics by another class and of the transfer of properties of modal logics under extensions of the underlying modal language. We discuss: the transfer from normal polymodal logics to their fusions, the transfer from normal modal logics to their extensions by adding the universal modality, and the transfer from normal monomodal logics to minimal tense extensions. Likewise, we discuss simulations of normal polymodal logics by normal (...)
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Combinations of Tense and Modality for Predicate Logic.Stefan Wölfl - 1999 - Journal of Philosophical Logic 28 (4):371-398.
    In recent years combinations of tense and modality have moved intothe focus of logical research. From a philosophical point of view, logical systems combining tense and modality are of interest because these logics have a wide field of application in original philosophical issues, for example in the theory of causation, of action, etc. But until now only methods yielding completeness results for propositional languages have been developed. In view of philosophical applications, analogous results with respect to languages of predicate logic (...)
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Completeness in Hybrid Type Theory.Carlos Areces, Patrick Blackburn, Antonia Huertas & María Manzano - 2013 - Journal of Philosophical Logic (2-3):1-30.
    We show that basic hybridization (adding nominals and @ operators) makes it possible to give straightforward Henkin-style completeness proofs even when the modal logic being hybridized is higher-order. The key ideas are to add nominals as expressions of type t, and to extend to arbitrary types the way we interpret $@_i$ in propositional and first-order hybrid logic. This means: interpret $@_i\alpha _a$ , where $\alpha _a$ is an expression of any type $a$ , as an expression of type $a$ that (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Preface.Jerry Seligman - 1995 - Journal of Logic, Language and Information 4 (3):175-176.
    Download  
     
    Export citation  
     
    Bookmark  
  • A Dynamic-Epistemic Hybrid Logic for Intentions and Information Changes in Strategic Games.O. Roy - 2009 - Synthese 171 (2):291 - 320.
    In this paper I present a dynamic-epistemic hybrid logic for reasoning about information and intention changes in situations of strategic interaction. I provide a complete axiomatization for this logic, and then use it to study intentions-based transformations of decision problems.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Notes on Logics of Metric Spaces.Oliver Kutz - 2007 - Studia Logica 85 (1):75-104.
    In [14], we studied the computational behaviour of various first-order and modal languages interpreted in metric or weaker distance spaces. [13] gave an axiomatisation of an expressive and decidable metric logic. The main result of this paper is in showing that the technique of representing metric spaces by means of Kripke frames can be extended to cover the modal (hybrid) language that is expressively complete over metric spaces for the (undecidable) two-variable fragment of first-order logic with binary pred-icates interpreting the (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Terminating Tableau Systems for Hybrid Logic with Difference and Converse.Mark Kaminski & Gert Smolka - 2009 - Journal of Logic, Language and Information 18 (4):437-464.
    This paper contributes to the principled construction of tableau-based decision procedures for hybrid logic with global, difference, and converse modalities. We also consider reflexive and transitive relations. For converse-free formulas we present a terminating control that does not rely on the usual chain-based blocking scheme. Our tableau systems are based on a new model existence theorem.
    Download  
     
    Export citation  
     
    Bookmark   6 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   31 citations  
  • 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   20 citations  
  • Complete Additivity and Modal Incompleteness.Wesley H. Holliday & Tadeusz Litak - 2019 - Review of Symbolic Logic 12 (3):487-535.
    In this article, we tell a story about incompleteness in modal logic. The story weaves together an article of van Benthem, “Syntactic aspects of modal incompleteness theorems,” and a longstanding open question: whether every normal modal logic can be characterized by a class of completely additive modal algebras, or as we call them, ${\cal V}$-baos. Using a first-order reformulation of the property of complete additivity, we prove that the modal logic that starred in van Benthem’s article resolves the open question (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Elementary Canonical Formulae: A Survey on Syntactic, Algorithmic, and Modeltheoretic Aspects.W. Conradie, V. Goranko & D. Vakarelov - 2005 - In Renate Schmidt, Ian Pratt-Hartmann, Mark Reynolds & Heinrich Wansing (eds.), Advances in Modal Logic, Volume 5. Kings College London Publ.. pp. 17-51.
    In terms of validity in Kripke frames, a modal formula expresses a universal monadic second-order condition. Those modal formulae which are equivalent to first-order conditions are called elementary. Modal formulae which have a certain persistence property which implies their validity in all canonical frames of modal logics axiomatized with them, and therefore their completeness, are called canonical. This is a survey of a recent and ongoing study of the class of elementary and canonical modal formulae. We summarize main ideas and (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Modal Logic and Universal Algebra I: Modal Axiomatizations of Structures.Valentin Goranko & Dimiter Vakarelov - 2000 - In Michael Zakharyaschev, Krister Segerberg, Maarten de Rijke & Heinrich Wansing (eds.), Advances in Modal Logic, Volume 2. CSLI Publications. pp. 265-292.
    We study the general problem of axiomatizing structures in the framework of modal logic and present a uniform method for complete axiomatization of the modal logics determined by a large family of classes of structures of any signature.
    Download  
     
    Export citation  
     
    Bookmark  
  • Synthetic Completeness Proofs for Seligman-Style Tableau Systems.Klaus Frovin Jørgensen, Patrick Blackburn, Thomas Bolander & Torben Braüner - 2016 - In Lev Beklemishev, Stéphane Demri & András Máté (eds.), Advances in Modal Logic, Volume 11. CSLI Publications. pp. 302-321.
    Download  
     
    Export citation  
     
    Bookmark  
  • Analogues of Bull’s Theorem for Hybrid Logic.Willem Conradie & Claudette Robinson - 2019 - Logic Journal of the IGPL 27 (3):281-313.
    Download  
     
    Export citation  
     
    Bookmark  
  • Derivation Rules as Anti-Axioms.Yde Venema - 1993 - Journal of Symbolic Logic 58:1003-1034.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Modal Languages for Topology: Expressivity and Definability.Balder ten Cate, David Gabelaia & Dmitry Sustretov - 2009 - Annals of Pure and Applied Logic 159 (1-2):146-170.
    In this paper we study the expressive power and definability for modal languages interpreted on topological spaces. We provide topological analogues of the van Benthem characterization theorem and the Goldblatt–Thomason definability theorem in terms of the well-established first-order topological language.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Simple Cut Elimination Proof for Hybrid Logic.Andrezj Indrzejczak - 2016 - Logic and Logical Philosophy 25 (2):129-141.
    In the paper we present a relatively simple proof of cut elimination theorem for variety of hybrid logics in the language with satisfaction operators and universal modality. The proof is based on the strategy introduced originally in the framework of hypersequent calculi but it works well also for standard sequent calculi. Sequent calculus examined in the paper works on so called satisfaction formulae and cover all logics adequate with respect to classes of frames defined by so called geometric conditions.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Goldblatt-Thomason-Style Theorems for Graded Modal Language.Katsuhiko Sano & Minghui Ma - 2010 - In Lev Beklemishev, Valentin Goranko & Valentin Shehtman (eds.), Advances in Modal Logic, Volume 8. CSLI Publications. pp. 330-349.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Hybrid Logics with Sahlqvist Axioms.ten Cate Balder, Marx Maarten & Viana Petrúcio - 2005 - Logic Journal of the IGPL 13 (3):293-300.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • 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   25 citations  
  • A Road Map of Interval Temporal Logics and Duration Calculi.Valentin Goranko, Angelo Montanari & Guido Sciavicco - 2004 - Journal of Applied Non-Classical Logics 14 (1-2):9-54.
    We survey main developments, results, and open problems on interval temporal logics and duration calculi. We present various formal systems studied in the literature and discuss their distinctive features, emphasizing on expressiveness, axiomatic systems, and (un)decidability results.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Inequality Without Irreflexivity.Philippe Balbiani - 1999 - Journal of Applied Non-Classical Logics 9 (4):523-534.
    ABSTRACT This paper presents the axioinatization—without the rule of irreflexivity—of the modal logic of inequality as well as a method for proving its completeness. This method uses the technics of the frame of subordination.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Hyperboolean Algebras and Hyperboolean Modal Logic.Valentin Goranko & Dimiter Vakarelov - 1999 - Journal of Applied Non-Classical Logics 9 (2):345-368.
    Hyperboolean algebras are Boolean algebras with operators, constructed as algebras of complexes (or, power structures) of Boolean algebras. They provide an algebraic semantics for a modal logic (called here a {\em hyperboolean modal logic}) with a Kripke semantics accordingly based on frames in which the worlds are elements of Boolean algebras and the relations correspond to the Boolean operations. We introduce the hyperboolean modal logic, give a complete axiomatization of it, and show that it lacks the finite model property. The (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Temporal Logics with Reference Pointers and Computation Tree Logics.Valentin Goranko - 2000 - Journal of Applied Non-Classical Logics 10 (3):221-242.
    A complete axiomatic system CTL$_{rp}$ is introduced for a temporal logic for finitely branching $\omega^+$-trees in a temporal language extended with so called reference pointers. Syntactic and semantic interpretations are constructed for the branching time computation tree logic CTL$^{*}$ into CTL$_{rp}$. In particular, that yields a complete axiomatization for the translations of all valid CTL$^{*}$-formulae. Thus, the temporal logic with reference pointers is brought forward as a simpler (with no path quantifiers), but in a way more expressive medium for reasoning (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • The Modal Logic of Inequality.Maarten de Rijke - 1992 - Journal of Symbolic Logic 57 (2):566-584.
    We consider some modal languages with a modal operator $D$ whose semantics is based on the relation of inequality. Basic logical properties such as definability, expressive power and completeness are studied. Also, some connections with a number of other recent proposals to extend the standard modal language are pointed at.
    Download  
     
    Export citation  
     
    Bookmark   27 citations  
  • The Monodic Fragment of Propositional Term Modal Logic.Anantha Padmanabha & R. Ramanujam - 2019 - Studia Logica 107 (3):533-557.
    We study term modal logics, where modalities can be indexed by variables that can be quantified over. We suggest that these logics are appropriate for reasoning about systems of unboundedly many reasoners and define a notion of bisimulation which preserves propositional fragment of term modal logics. Also we show that the propositional fragment is already undecidable but that its monodic fragment is decidable, and expressive enough to include interesting assertions.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Interpolation for Extended Modal Languages.Balder ten Cate - 2005 - Journal of Symbolic Logic 70 (1):223-234.
    Several extensions of the basic modal language are characterized in terms of interpolation. Our main results are of the following form: Language ℒ' is the least expressive extension of ℒ with interpolation. For instance, let ℳ be the extension of the basic modal language with a difference operator [7]. First-order logic is the least expressive extension of ℳ with interpolation. These characterizations are subsequently used to derive new results about hybrid logic, relation algebra and the guarded fragment.
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • 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  
  • Axiomatizing Hybrid Products.Katsuhiko Sano - 2010 - Journal of Applied Logic 8 (4):459-474.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Elementary Canonical Formulae: Extending Sahlqvist’s Theorem.Valentin Goranko & Dimiter Vakarelov - 2006 - Annals of Pure and Applied Logic 141 (1):180-217.
    We generalize and extend the class of Sahlqvist formulae in arbitrary polyadic modal languages, to the class of so called inductive formulae. To introduce them we use a representation of modal polyadic languages in a combinatorial style and thus, in particular, develop what we believe to be a better syntactic approach to elementary canonical formulae altogether. By generalizing the method of minimal valuations à la Sahlqvist–van Benthem and the topological approach of Sambin and Vaccaro we prove that all inductive formulae (...)
    Download  
     
    Export citation  
     
    Bookmark   19 citations