Switch to: References

Add citations

You must login to add citations.
  1. Definability theorems in normal extensions of the probability logic.Larisa L. Maksimova - 1989 - Studia Logica 48 (4):495-507.
    Three variants of Beth's definability theorem are considered. Let L be any normal extension of the provability logic G. It is proved that the first variant B1 holds in L iff L possesses Craig's interpolation property. If L is consistent, then the statement B2 holds in L iff L = G + {0}. Finally, the variant B3 holds in any normal extension of G.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • The Embedding Theorem: Its Further Developments and Consequences. Part 1.Alexei Y. Muravitsky - 2006 - Notre Dame Journal of Formal Logic 47 (4):525-540.
    We outline the Gödel-McKinsey-Tarski Theorem on embedding of Intuitionistic Propositional Logic Int into modal logic S4 and further developments which led to the Generalized Embedding Theorem. The latter in turn opened a full-scale comparative exploration of lattices of the (normal) extensions of modal propositional logic S4, provability logic GL, proof-intuitionistic logic KM, and others, including Int. The present paper is a contribution to this part of the research originated from the Gödel-McKinsey-Tarski Theorem. In particular, we show that the lattice ExtInt (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Modal companions of intermediate propositional logics.Alexander Chagrov & Michael Zakharyashchev - 1992 - Studia Logica 51 (1):49 - 82.
    This paper is a survey of results concerning embeddings of intuitionistic propositional logic and its extensions into various classical modal systems.
    Download  
     
    Export citation  
     
    Bookmark   21 citations  
  • Free and Projective Bimodal Symmetric Gödel Algebras.Revaz Grigolia, Tatiana Kiseliova & Vladimer Odisharia - 2016 - Studia Logica 104 (1):115-143.
    Gödel logic is the extension of intuitionistic logic by the linearity axiom. Symmetric Gödel logic is a logical system, the language of which is an enrichment of the language of Gödel logic with their dual logical connectives. Symmetric Gödel logic is the extension of symmetric intuitionistic logic. The proof-intuitionistic calculus, the language of which is an enrichment of the language of intuitionistic logic by modal operator was investigated by Kuznetsov and Muravitsky. Bimodal symmetric Gödel logic is a logical system, the (...)
    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  
  • Scattered toposes.Leo Esakia, Mamuka Jibladze & Dito Pataraia - 2000 - Annals of Pure and Applied Logic 103 (1-3):97-107.
    A class of toposes is introduced and studied, suitable for semantical analysis of an extension of the Heyting predicate calculus admitting Gödel's provability interpretation.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Frontal Operators in Weak Heyting Algebras.Sergio A. Celani & Hernán J. San Martín - 2012 - Studia Logica 100 (1-2):91-114.
    In this paper we shall introduce the variety FWHA of frontal weak Heyting algebras as a generalization of the frontal Heyting algebras introduced by Leo Esakia in [ 10 ]. A frontal operator in a weak Heyting algebra A is an expansive operator τ preserving finite meets which also satisfies the equation $${\tau(a) \leq b \vee (b \rightarrow a)}$$, for all $${a, b \in A}$$. These operators were studied from an algebraic, logical and topological point of view by Leo Esakia (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • The Kuznetsov-Gerčiu and Rieger-Nishimura logics.Guram Bezhanishvili, Nick Bezhanishvili & Dick de Jongh - 2008 - Logic and Logical Philosophy 17 (1-2):73-110.
    We give a systematic method of constructing extensions of the Kuznetsov-Gerčiu logic KG without the finite model property (fmp for short), and show that there are continuum many such. We also introduce a new technique of gluing of cyclic intuitionistic descriptive frames and give a new simple proof of Gerčiu’s result [9, 8] that all extensions of the Rieger-Nishimura logic RN have the fmp. Moreover, we show that each extension of RN has the poly-size model property, thus improving on [9]. (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Interconnection of the Lattices of Extensions of Four Logics.Alexei Y. Muravitsky - 2017 - Logica Universalis 11 (2):253-281.
    We show that the lattices of the normal extensions of four well-known logics—propositional intuitionistic logic \, Grzegorczyk logic \, modalized Heyting calculus \ and \—can be joined in a commutative diagram. One connection of this diagram is an isomorphism between the lattices of the normal extensions of \ and \; we show some preservation properties of this isomorphism. Two other connections are join semilattice epimorphims of the lattice of the normal extensions of \ onto that of \ and of the (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Admissible rules for six intuitionistic modal logics.Iris van der Giessen - 2023 - Annals of Pure and Applied Logic 174 (4):103233.
    Download  
     
    Export citation  
     
    Bookmark   2 citations