Switch to: References

Add citations

You must login to add citations.
  1. Theory and application of labelling techniques for interpretability logics.Evan Goris, Marta Bílková, Joost J. Joosten & Luka Mikec - 2022 - Mathematical Logic Quarterly 68 (3):352-374.
    The notion of a critical successor [5] in relational semantics has been central to most classic modal completeness proofs in interpretability logics. In this paper we shall work with a more general notion, that of an assuring successor. This will enable more concisely formulated completeness proofs, both with respect to ordinary and generalised Veltman semantics. Due to their interesting theoretical properties, we will devote some space to the study of a particular kind of assuring labels, the so‐called full labels and (...)
    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  
  • 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