Switch to: Citations

Add references

You must login to add references.
  1. Compositional semantics for a language of imperfect information.W. Hodges - 1997 - Logic Journal of the IGPL 5 (4):539-563.
    We describe a logic which is the same as first-order logic except that it allows control over the information that passes down from formulas to subformulas. For example the logic is adequate to express branching quantifiers. We describe a compositional semantics for this logic; in particular this gives a compositional meaning to formulas of the 'information-friendly' language of Hintikka and Sandu. For first-order formulas the semantics reduces to Tarski's semantics for first-order logic. We prove that two formulas have the same (...)
    Download  
     
    Export citation  
     
    Bookmark   137 citations  
  • A Sahlqvist theorem for distributive modal logic.Mai Gehrke, Hideo Nagahashi & Yde Venema - 2004 - Annals of Pure and Applied Logic 131 (1-3):65-102.
    In this paper we consider distributive modal logic, a setting in which we may add modalities, such as classical types of modalities as well as weak forms of negation, to the fragment of classical propositional logic given by conjunction, disjunction, true, and false. For these logics we define both algebraic semantics, in the form of distributive modal algebras, and relational semantics, in the form of ordered Kripke structures. The main contributions of this paper lie in extending the notion of Sahlqvist (...)
    Download  
     
    Export citation  
     
    Bookmark   36 citations  
  • Functorial duality for ortholattices and de Morgan lattices.Katalin Bimbó - 2007 - Logica Universalis 1 (2):311-333.
    . Relational semantics for nonclassical logics lead straightforwardly to topological representation theorems of their algebras. Ortholattices and De Morgan lattices are reducts of the algebras of various nonclassical logics. We define three new classes of topological spaces so that the lattice categories and the corresponding categories of topological spaces turn out to be dually isomorphic. A key feature of all these topological spaces is that they are ordered relational or ordered product topologies.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • A new proof of Sahlqvist's theorem on modal definability and completeness.G. Sambin & V. Vaccaro - 1989 - Journal of Symbolic Logic 54 (3):992-999.
    Download  
     
    Export citation  
     
    Bookmark   28 citations  
  • Semantic analysis of orthologic.R. I. Goldblatt - 1974 - Journal of Philosophical Logic 3 (1/2):19 - 35.
    Download  
     
    Export citation  
     
    Bookmark   101 citations  
  • Choice-free stone duality.Nick Bezhanishvili & Wesley H. Holliday - 2020 - Journal of Symbolic Logic 85 (1):109-148.
    The standard topological representation of a Boolean algebra via the clopen sets of a Stone space requires a nonconstructive choice principle, equivalent to the Boolean Prime Ideal Theorem. In this article, we describe a choice-free topological representation of Boolean algebras. This representation uses a subclass of the spectral spaces that Stone used in his representation of distributive lattices via compact open sets. It also takes advantage of Tarski’s observation that the regular open sets of any topological space form a Boolean (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Modal dependence logics: axiomatizations and model-theoretic properties.Fan Yang - 2017 - Logic Journal of the IGPL 25 (5):773-805.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • (2 other versions)Modal Logic.Patrick Blackburn, Maarten de Rijke & Yde Venema - 2001 - Studia Logica 76 (1):142-148.
    Download  
     
    Export citation  
     
    Bookmark   391 citations  
  • Positive modal logic.J. Michael Dunn - 1995 - Studia Logica 55 (2):301 - 317.
    We give a set of postulates for the minimal normal modal logicK + without negation or any kind of implication. The connectives are simply , , , . The postulates (and theorems) are all deducibility statements . The only postulates that might not be obvious are.
    Download  
     
    Export citation  
     
    Bookmark   56 citations  
  • Algorithmic correspondence and canonicity for non-distributive logics.Willem Conradie & Alessandra Palmigiano - 2019 - Annals of Pure and Applied Logic 170 (9):923-974.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Propositional team logics.Fan Yang & Jouko Väänänen - 2017 - Annals of Pure and Applied Logic 168 (7):1406-1441.
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  • Priestley duality, a Sahlqvist theorem and a Goldblatt-Thomason theorem for positive modal logic.S. Celani & R. Jansana - 1999 - Logic Journal of the IGPL 7 (6):683-715.
    In [12] the study of Positive Modal Logic is initiated using standard Kripke semantics and the positive modal algebras are introduced. The minimum system of Positive Modal Logic is the -fragment of the local consequence relation defined by the class of all Kripke models. It can be axiomatized by a sequent calculus and extensions of it can be obtained by adding sequents as new axioms. In [6] a new semantics for PML is proposed to overcome some frame incompleteness problems discussed (...)
    Download  
     
    Export citation  
     
    Bookmark   25 citations  
  • Varieties of complex algebras.Robert Goldblatt - 1989 - Annals of Pure and Applied Logic 44 (3):173-242.
    Download  
     
    Export citation  
     
    Bookmark   66 citations