Switch to: References

Add citations

You must login to add citations.
  1. Existential Definability of Modal Frame Classes.Tin Perkov & Luka Mikec - forthcoming - Mathematical Logic Quarterly.
    Download  
     
    Export citation  
     
    Bookmark  
  • PDL with Negation of Atomic Programs.Carsten Lutz & Dirk Walther - 2005 - Journal of Applied Non-Classical Logics 15 (2):189-213.
    Propositional dynamic logic is one of the most successful variants of modal logic. To make it even more useful for applications, many extensions of PDL have been considered in the literature. A very natural and useful such extension is with negation of programs. Unfortunately, as long-known, reasoning with the resulting logic is undecidable. In this paper, we consider the extension of PDL with negation of atomic programs, only. We argue that this logic is still useful, e.g. in the context of (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Modal Logic with Names.George Gargov & Valentin Goranko - 1993 - Journal of Philosophical Logic 22 (6):607 - 636.
    We investigate an enrichment of the propositional modal language L with a "universal" modality ■ having semantics x ⊧ ■φ iff ∀y(y ⊧ φ), and a countable set of "names" - a special kind of propositional variables ranging over singleton sets of worlds. The obtained language ℒ $_{c}$ proves to have a great expressive power. It is equivalent with respect to modal definability to another enrichment ℒ(⍯) of ℒ, where ⍯ is an additional modality with the semantics x ⊧ ⍯φ (...)
    Download  
     
    Export citation  
     
    Bookmark   47 citations  
  • Local Goldblatt–Thomason Theorem.Evgeny Zolin - 2015 - Logic Journal of the IGPL 23 (6):861-880.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • On the Modal Logic of Subset and Superset: Tense Logic Over Medvedev Frames.Wesley 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  
  • The Range of Modal Logic: An Essay in Memory of George Gargov.Johan van Benthem - 1999 - Journal of Applied Non-Classical Logics 9 (2-3):407-442.
    ABSTRACT George Gargov was an active pioneer in the ‘Sofia School’ of modal logicians. Starting in the 1970s, he and his colleagues expanded the scope of the subject by introducing new modal expressive power, of various innovative kinds. The aim of this paper is to show some general patterns behind such extensions, and review some very general results that we know by now, 20 years later. We concentrate on simulation invariance, decidability, and correspondence. What seems clear is that ‘modal logic’ (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • An Efficient Relational Deductive System for Propositional Non-Classical Logics.Andrea Formisano & Marianna Nicolosi-Asmundo - 2006 - Journal of Applied Non-Classical Logics 16 (3-4):367-408.
    We describe a relational framework that uniformly supports formalization and automated reasoning in varied propositional modal logics. The proof system we propose is a relational variant of the classical Rasiowa-Sikorski proof system. We introduce a compact graph-based representation of formulae and proofs supporting an efficient implementation of the basic inference engine, as well as of a number of refinements. Completeness and soundness results are shown and a Prolog implementation is described.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Understanding the Brandenburger-Keisler Paradox.Eric Pacuit - 2007 - Studia Logica 86 (3):435-454.
    Adam Brandenburger and H. Jerome Keisler have recently discovered a two person Russell-style paradox. They show that the following configurations of beliefs is impossible: Ann believes that Bob assumes that Ann believes that Bob’s assumption is wrong. In [7] a modal logic interpretation of this paradox is proposed. The idea is to introduce two modal operators intended to represent the agents’ beliefs and assumptions. The goal of this paper is to take this analysis further and study this paradox from the (...)
    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  
  • Boolean Algebras Arising From Information Systems.Ivo Düntsch & Ewa Orłowska - 2004 - Annals of Pure and Applied Logic 127 (1-3):77-98.
    Following the theory of Boolean algebras with modal operators , in this paper we investigate Boolean algebras with sufficiency operators and mixed operators . We present results concerning representability, generation by finite members, first order axiomatisability, possession of a discriminator term etc. We generalise the classes BAO, SUA, and MIA to classes of algebras with the families of relative operators. We present examples of the discussed classes of algebras that arise in connection with reasoning with incomplete information.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • 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   28 citations  
  • The Range of Modal Logic: An Essay in Memory of George Gargov.Johan van Benthem - 1999 - Journal of Applied Non-Classical Logics 9 (2):407-442.
    ABSTRACT George Gargov was an active pioneer in the ‘Sofia School’ of modal logicians. Starting in the 1970s, he and his colleagues expanded the scope of the subject by introducing new modal expressive power, of various innovative kinds. The aim of this paper is to show some general patterns behind such extensions, and review some very general results that we know by now, 20 years later. We concentrate on simulation invariance, decidability, and correspondence. What seems clear is that ‘modal logic’ (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • European Summer Meeting of the Association for Symbolic Logic (Logic Colloquium'88), Padova, 1988.R. Ferro - 1990 - Journal of Symbolic Logic 55 (1):387-435.
    Download  
     
    Export citation  
     
    Bookmark