Switch to: Citations

Add references

You must login to add references.
  1. Negation in the Context of Gaggle Theory.J. Michael Dunn & Chunlai Zhou - 2005 - Studia Logica 80 (2):235-264.
    We study an application of gaggle theory to unary negative modal operators. First we treat negation as impossibility and get a minimal logic system Ki that has a perp semantics. Dunn 's kite of different negations can be dealt with in the extensions of this basic logic Ki. Next we treat negation as “unnecessity” and use a characteristic semantics for different negations in a kite which is dual to Dunn 's original one. Ku is the minimal logic that has a (...)
    Download  
     
    Export citation  
     
    Bookmark   30 citations  
  • Intuitionistic propositional logic with Galois connections.Wojciech Dzik, Jouni Järvinen & Michiro Kondo - 2010 - Logic Journal of the IGPL 18 (6):837-858.
    In this work, an intuitionistic propositional logic with a Galois connection is introduced. In addition to the intuitionistic logic axioms and inference rule of modus ponens, the logic contains only two rules of inference mimicking the performance of Galois connections. Both Kripke-style and algebraic semantics are presented for IntGC, and IntGC is proved to be complete with respect to both of these semantics. We show that IntGC has the finite model property and is decidable, but Glivenko's Theorem does not hold. (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Some theorems about the sentential calculi of Lewis and Heyting.J. C. C. McKinsey & Alfred Tarski - 1948 - Journal of Symbolic Logic 13 (1):1-15.
    Download  
     
    Export citation  
     
    Bookmark   150 citations  
  • Galois structures.Andrzej W. Jankowski - 1985 - Studia Logica 44 (2):109 - 124.
    This paper is a continuation of investigations on Galois connections from [1], [3], [10]. It is a continuation of [2]. We have shown many results that link properties of a given closure space with that of the dual space. For example: for every -disjunctive closure space X the dual closure space is topological iff the base of X generated by this dual space consists of the -prime sets in X (Theorem 2). Moreover the characterizations of the satisfiability relation for classical (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Intuitionistic tense and modal logic.W. B. Ewald - 1986 - Journal of Symbolic Logic 51 (1):166-179.
    Download  
     
    Export citation  
     
    Bookmark   36 citations  
  • Star and perp: Two treatments of negation.J. Michael Dunn - 1993 - Philosophical Perspectives 7:331-357.
    Download  
     
    Export citation  
     
    Bookmark   73 citations  
  • Independent propositional modal logics.S. K. Thomason - 1980 - Studia Logica 39 (2-3):143 - 144.
    We show that the join of two classical [respectively, regular, normal] modal logics employing distinct modal operators is a conservative extension of each of them.
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Heyting Algebras: Duality Theory.Leo Esakia - 2019 - Cham, Switzerland: Springer Verlag.
    This book presents an English translation of a classic Russian text on duality theory for Heyting algebras. Written by Georgian mathematician Leo Esakia, the text proved popular among Russian-speaking logicians. This translation helps make the ideas accessible to a wider audience and pays tribute to an influential mind in mathematical logic. The book discusses the theory of Heyting algebras and closure algebras, as well as the corresponding intuitionistic and modal logics. The author introduces the key notion of a hybrid that (...)
    Download  
     
    Export citation  
     
    Bookmark   27 citations  
  • Characterizing intermediate tense logics in terms of Galois connections.W. Dzik, J. Jarvinen & M. Kondo - 2014 - Logic Journal of the IGPL 22 (6):992-1018.
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • On intuitionistic modal and tense logics and their classical companion logics: Topological semantics and bisimulations.Jennifer M. Davoren - 2010 - Annals of Pure and Applied Logic 161 (3):349-367.
    We take the well-known intuitionistic modal logic of Fischer Servi with semantics in bi-relational Kripke frames, and give the natural extension to topological Kripke frames. Fischer Servi’s two interaction conditions relating the intuitionistic pre-order with the modal accessibility relation generalize to the requirement that the relation and its inverse be lower semi-continuous with respect to the topology. We then investigate the notion of topological bisimulation relations between topological Kripke frames, as introduced by Aiello and van Benthem, and show that their (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Countably Many Weakenings of Belnap–Dunn Logic.Minghui Ma & Yuanlei Lin - 2020 - Studia Logica 108 (2):163-198.
    Every Berman’s variety \ which is the subvariety of Ockham algebras defined by the equation \ and \) determines a finitary substitution invariant consequence relation \. A sequent system \ is introduced as an axiomatization of the consequence relation \. The system \ is characterized by a single finite frame \ under the frame semantics given for the formal language. By the duality between frames and algebras, \ can be viewed as a \-valued logic as it is characterized by a (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Polarity Semantics for Negation as a Modal Operator.Yuanlei Lin & Minghui Ma - 2020 - Studia Logica 108 (5):877-902.
    The minimal weakening \ of Belnap-Dunn logic under the polarity semantics for negation as a modal operator is formulated as a sequent system which is characterized by the class of all birelational frames. Some extensions of \ with additional sequents as axioms are introduced. In particular, all three modal negation logics characterized by a frame with a single state are formalized as extensions of \. These logics have the finite model property and they are decidable.
    Download  
     
    Export citation  
     
    Bookmark   4 citations