Switch to: References

Add citations

You must login to add citations.
  1. 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.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   11 citations  
  • A Dichotomy for Some Elementarily Generated Modal Logics.Stanislav Kikot - 2015 - Studia Logica 103 (5):1063-1093.
    In this paper we consider the normal modal logics of elementary classes defined by first-order formulas of the form \. We prove that many properties of these logics, such as finite axiomatisability, elementarity, axiomatisability by a set of canonical formulas or by a single generalised Sahlqvist formula, together with modal definability of the initial formula, either simultaneously hold or simultaneously do not hold.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Varieties of complex algebras.Robert Goldblatt - 1989 - Annals of Pure and Applied Logic 44 (3):173-242.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   66 citations  
  • Mathematical modal logic: A view of its evolution.Robert Goldblatt - 2003 - Journal of Applied Logic 1 (5-6):309-392.
  • On Sahlqvist Formulas in Relevant Logic.Guillermo Badia - 2018 - Journal of Philosophical Logic 47 (4):673-691.
    This paper defines a Sahlqvist fragment for relevant logic and establishes that each class of frames in the Routley-Meyer semantics which is definable by a Sahlqvist formula is also elementary, that is, it coincides with the class of structures satisfying a given first order property calculable by a Sahlqvist-van Benthem algorithm. Furthermore, we show that some classes of Routley-Meyer frames definable by a relevant formula are not elementary.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations