Switch to: References

Add citations

You must login to add citations.
  1. Tree-like constructions in topology and modal logic.G. Bezhanishvili, N. Bezhanishvili, J. Lucero-Bryan & J. Van Mill - 2020 - Archive for Mathematical Logic 60 (3):265-299.
    Within ZFC, we develop a general technique to topologize trees that provides a uniform approach to topological completeness results in modal logic with respect to zero-dimensional Hausdorff spaces. Embeddings of these spaces into well-known extremally disconnected spaces then gives new completeness results for logics extending S4.2.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Scattered and hereditarily irresolvable spaces in modal logic.Guram Bezhanishvili & Patrick J. Morandi - 2010 - Archive for Mathematical Logic 49 (3):343-365.
    When we interpret modal ◊ as the limit point operator of a topological space, the Gödel-Löb modal system GL defines the class Scat of scattered spaces. We give a partition of Scat into α-slices S α , where α ranges over all ordinals. This provides topological completeness and definability results for extensions of GL. In particular, we axiomatize the modal logic of each ordinal α, thus obtaining a simple proof of the Abashidze–Blass theorem. On the other hand, when we interpret (...)
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Some Results on Modal Axiomatization and Definability for Topological Spaces.Guram Bezhanishvili, Leo Esakia & David Gabelaia - 2005 - Studia Logica 81 (3):325-355.
    We consider two topological interpretations of the modal diamond—as the closure operator (C-semantics) and as the derived set operator (d-semantics). We call the logics arising from these interpretations C-logics and d-logics, respectively. We axiomatize a number of subclasses of the class of nodec spaces with respect to both semantics, and characterize exactly which of these classes are modally definable. It is demonstrated that the d-semantics is more expressive than the C-semantics. In particular, we show that the d-logics of the six (...)
    Download  
     
    Export citation  
     
    Bookmark   29 citations  
  • Topological completeness of the provability logic GLP.Lev Beklemishev & David Gabelaia - 2013 - Annals of Pure and Applied Logic 164 (12):1201-1223.
    Provability logic GLP is well-known to be incomplete w.r.t. Kripke semantics. A natural topological semantics of GLP interprets modalities as derivative operators of a polytopological space. Such spaces are called GLP-spaces whenever they satisfy all the axioms of GLP. We develop some constructions to build nontrivial GLP-spaces and show that GLP is complete w.r.t. the class of all GLP-spaces.
    Download  
     
    Export citation  
     
    Bookmark   17 citations  
  • Foreword.Lev Beklemishev, Guram Bezhanishvili, Daniele Mundici & Yde Venema - 2012 - Studia Logica 100 (1-2):1-7.
    Download  
     
    Export citation  
     
    Bookmark  
  • The d-Logic of the Rational Numbers: A Fruitful Construction.Joel Lucero-Bryan - 2011 - Studia Logica 97 (2):265-295.
    We present a geometric construction that yields completeness results for modal logics including K4, KD4, GL and GL n with respect to certain subspaces of the rational numbers. These completeness results are extended to the bimodal case with the universal modality.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • A topological completeness theorem for transfinite provability logic.Juan P. Aguilera - 2023 - Archive for Mathematical Logic 62 (5):751-788.
    We prove a topological completeness theorem for the modal logic $$\textsf{GLP}$$ GLP containing operators $$\{\langle \xi \rangle :\xi \in \textsf{Ord}\}$$ { ⟨ ξ ⟩ : ξ ∈ Ord } intended to capture a wellordered sequence of consistency operators increasing in strength. More specifically, we prove that, given a tall-enough scattered space X, any sentence $$\phi $$ ϕ consistent with $$\textsf{GLP}$$ GLP can be satisfied on a polytopological space based on finitely many Icard topologies constructed over X and corresponding to the (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Completeness of the Gödel–Löb Provability Logic for the Filter Sequence of Normal Measures.Mohammad Golshani & Reihane Zoghifard - 2024 - Journal of Symbolic Logic 89 (1):163-174.
    Assuming the existence of suitable large cardinals, we show it is consistent that the Provability logic $\mathbf {GL}$ is complete with respect to the filter sequence of normal measures. This result answers a question of Andreas Blass from 1990 and a related question of Beklemishev and Joosten.
    Download  
     
    Export citation  
     
    Bookmark  
  • Taming the ‘Elsewhere’: On Expressivity of Topological Languages.David Fernández-Duque - 2024 - Review of Symbolic Logic 17 (1):144-153.
    In topological modal logic, it is well known that the Cantor derivative is more expressive than the topological closure, and the ‘elsewhere’, or ‘difference’, operator is more expressive than the ‘somewhere’ operator. In 2014, Kudinov and Shehtman asked whether the combination of closure and elsewhere becomes strictly more expressive when adding the Cantor derivative. In this paper we give an affirmative answer: in fact, the Cantor derivative alone can define properties of topological spaces not expressible with closure and elsewhere. To (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Leo Esakia on Duality in Modal and Intuitionistic Logics.Guram Bezhanishvili (ed.) - 2014 - Dordrecht, Netherland: Springer.
    This volume is dedicated to Leo Esakia's contributions to the theory of modal and intuitionistic systems. Consisting of 10 chapters, written by leading experts, this volume discusses Esakia’s original contributions and consequent developments that have helped to shape duality theory for modal and intuitionistic logics and to utilize it to obtain some major results in the area. Beginning with a chapter which explores Esakia duality for S4-algebras, the volume goes on to explore Esakia duality for Heyting algebras and its generalizations (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Non–well-founded derivations in the gödel-löb provability logic.Daniyar Shamkanov - 2020 - Review of Symbolic Logic 13 (4):776-796.
    We consider Hilbert-style non–well-founded derivations in the Gödel-Löb provability logic GL and establish that GL with the obtained derivability relation is globally complete for algebraic and neighbourhood semantics.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Foreword.Daniele Mundici - 1998 - Studia Logica 61 (1):1-1.
    Download  
     
    Export citation  
     
    Bookmark  
  • Topological Structure of Diagonalizable Algebras and Corresponding Logical Properties of Theories.Giovanna D'Agostino - 1994 - Notre Dame Journal of Formal Logic 35 (4):563-572.
    This paper studies the topological duality between diagonalizable algebras and bi-topological spaces. In particular, the correspondence between algebraic properties of a diagonalizable algebra and topological properties of its dual space is investigated. Since the main example of a diagonalizable algebra is the Lindenbaum algebra of an r.e. theory extending Peano Arithmetic, endowed with an operator defined by means of the provability predicate of the theory, this duality gives the possibility to study arithmetical properties of theories from a topological point of (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Can modalities save naive set theory?Peter Fritz, Harvey Lederman, Tiankai Liu & Dana Scott - 2018 - Review of Symbolic Logic 11 (1):21-47.
    Download  
     
    Export citation  
     
    Bookmark  
  • The polytopologies of transfinite provability logic.David Fernández-Duque - 2014 - Archive for Mathematical Logic 53 (3-4):385-431.
    Provability logics are modal or polymodal systems designed for modeling the behavior of Gödel’s provability predicate and its natural extensions. If Λ is any ordinal, the Gödel-Löb calculus GLPΛ contains one modality [λ] for each λ < Λ, representing provability predicates of increasing strength. GLPω has no non-trivial Kripke frames, but it is sound and complete for its topological semantics, as was shown by Icard for the variable-free fragment and more recently by Beklemishev and Gabelaia for the full logic. In (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Remarks on Ontological Dependence in Set Theory.Thomas Macaulay Ferguson - 2016 - Australasian Journal of Logic 13 (3):41-57.
    In a recent paper, John Wigglesworth explicates the notion of a set's being grounded in or ontologically depending on its members by the modal statement that in any world, that a set exists in that world entails that its members exist as well. After suggesting that variable-domain S5 captures an appropriate account of metaphysical necessity, Wigglesworth purports to prove that in any set theory satisfying the axiom Extensionality this condition holds, that is, that sets ontologically depend on their members with (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Intuitionistic logic and modality via topology.Leo Esakia - 2004 - Annals of Pure and Applied Logic 127 (1-3):155-170.
    In the pioneering article and two papers, written jointly with McKinsey, Tarski developed the so-called algebraic and topological frameworks for the Intuitionistic Logic and the Lewis modal system. In this paper, we present an outline of modern systems with a topological tinge. We consider topological interpretation of basic systems GL and G of the provability logic in terms of the Cantor derivative and the Hausdorff residue.
    Download  
     
    Export citation  
     
    Bookmark   24 citations  
  • Provability logic.Rineke Verbrugge - 2008 - Stanford Encyclopedia of Philosophy.
    -/- Provability logic is a modal logic that is used to investigate what arithmetical theories can express in a restricted language about their provability predicates. The logic has been inspired by developments in meta-mathematics such as Gödel’s incompleteness theorems of 1931 and Löb’s theorem of 1953. As a modal logic, provability logic has been studied since the early seventies, and has had important applications in the foundations of mathematics. -/- From a philosophical point of view, provability logic is interesting because (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations