Switch to: Citations

Add references

You must login to add references.
  1. 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   69 citations  
  • (1 other version)Sahlqvist's Theorem for Boolean Algebras with Operators with an Application to Cylindric Algebras.Maarten De Rijke & Yde Venema - 1995 - Studia Logica 54 (1):61 - 78.
    For an arbitrary similarity type of Boolean Algebras with Operators we define a class of Sahlqvist identities. Sahlqvist identities have two important properties. First, a Sahlqvist identity is valid in a complex algebra if and only if the underlying relational atom structure satisfies a first-order condition which can be effectively read off from the syntactic form of the identity. Second, and as a consequence of the first property, Sahlqvist identities are canonical, that is, their validity is preserved under taking canonical (...)
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Erdős graphs resolve fine's canonicity problem.Robert Goldblatt, Ian Hodkinson & Yde Venema - 2004 - Bulletin of Symbolic Logic 10 (2):186-208.
    We show that there exist 2 ℵ 0 equational classes of Boolean algebras with operators that are not generated by the complex algebras of any first-order definable class of relational structures. Using a variant of this construction, we resolve a long-standing question of Fine, by exhibiting a bimodal logic that is valid in its canonical frames, but is not sound and complete for any first-order definable class of Kripke frames (a monomodal example can then be obtained using simulation results of (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Constructive canonicity in non-classical logics.Silvio Ghilardi & Giancarlo Meloni - 1997 - Annals of Pure and Applied Logic 86 (1):1-32.
    Sufficient syntactic conditions for canonicity in intermediate and intuitionistic modal logics are given. We present a new technique which does not require semantic first-order reduction and which is constructive in the sense that it works in an intuitionistic metatheory through a model without points which is classically isomorphic to the usual canonical model.
    Download  
     
    Export citation  
     
    Bookmark   20 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  
  • 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   13 citations  
  • Varieties of complex algebras.Robert Goldblatt - 1989 - Annals of Pure and Applied Logic 44 (3):173-242.
    Download  
     
    Export citation  
     
    Bookmark   68 citations  
  • First-order definability in modal logic.R. I. Goldblatt - 1975 - Journal of Symbolic Logic 40 (1):35-40.
    It is shown that a formula of modal propositional logic has precisely the same models as a sentence of the first-order language of a single dyadic predicate iff its class of models is closed under ultraproducts. as a corollary, any modal formula definable by a set of first-order conditions is always definable by a single such condition. these results are then used to show that the formula (lmp 'validates' mlp) is not first-order definable.
    Download  
     
    Export citation  
     
    Bookmark   16 citations  
  • (1 other version)Sahlqvist's theorem for Boolean algebras with operators with an application to cylindric algebras.Maarten de Rijke & Yde Venema - 1995 - Studia Logica 54 (1):61-78.
    For an arbitrary similarity type of Boolean Algebras with Operators we define a class ofSahlqvist identities. Sahlqvist identities have two important properties. First, a Sahlqvist identity is valid in a complex algebra if and only if the underlying relational atom structure satisfies a first-order condition which can be effectively read off from the syntactic form of the identity. Second, and as a consequence of the first property, Sahlqvist identities arecanonical, that is, their validity is preserved under taking canonical embedding algebras. (...)
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • (1 other version)Derivation rules as anti-axioms in modal logic.Yde Venema - 1993 - Journal of Symbolic Logic 58 (3):1003-1034.
    We discuss a `negative' way of defining frame classes in (multi)modal logic, and address the question of whether these classes can be axiomatized by derivation rules, the `non-ξ rules', styled after Gabbay's Irreflexivity Rule. The main result of this paper is a metatheorem on completeness, of the following kind: If Λ is a derivation system having a set of axioms that are special Sahlqvist formulas and Λ+ is the extension of Λ with a set of non-ξ rules, then Λ+ is (...)
    Download  
     
    Export citation  
     
    Bookmark   33 citations  
  • Persistence and atomic generation for varieties of Boolean algebras with operators.Robert Goldblatt - 2001 - Studia Logica 68 (2):155-171.
    A variety V of Boolean algebras with operators is singleton-persistent if it contains a complex algebra whenever it contains the subalgebra generated by the singletons. V is atom-canonical if it contains the complex algebra of the atom structure of any of the atomic members of V.This paper explores relationships between these "persistence" properties and questions of whether V is generated by its complex algebras or its atomic members, or is closed under canonical embedding algebras or completions. It also develops a (...)
    Download  
     
    Export citation  
     
    Bookmark   11 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  
  • Topology and duality in modal logic.Giovanni Sambin & Virginia Vaccaro - 1988 - Annals of Pure and Applied Logic 37 (3):249-296.
    Download  
     
    Export citation  
     
    Bookmark   28 citations  
  • An incomplete system of modal logic.George Boolos & Giovanni Sambin - 1985 - Journal of Philosophical Logic 14 (4):351 - 358.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • On the canonicity of Sahlqvist identities.Bjarni Jónsson - 1994 - Studia Logica 53 (4):473 - 491.
    We give a simple proof of the canonicity of Sahlqvist identities, using methods that were introduced in a paper by Jónsson and Tarski in 1951.
    Download  
     
    Export citation  
     
    Bookmark   17 citations