Switch to: References

Add citations

You must login to add citations.
  1. (1 other version)An application of kripke's completeness theorem for intuitionism to superconstructive propositional calculi.J. G. Anderson - 1969 - Mathematical Logic Quarterly 15 (16-18):259-288.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • A family of genuine and non-algebraisable C-systems.Mauricio Osorio, Aldo Figallo-Orellano & Miguel Pérez-Gaspar - 2021 - Journal of Applied Non-Classical Logics 31 (1):56-84.
    In 2016, Béziau introduced the notion of genuine paraconsistent logic as logic that does not verify the principle of non-contradiction; as an important example, he presented the genuine paraconsist...
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Algebraic Completeness Results for Dummett's LC and Its Extensions.J. Michael Dunn & Robert K. Meyer - 1971 - Mathematical Logic Quarterly 17 (1):225-230.
    Download  
     
    Export citation  
     
    Bookmark   17 citations  
  • (1 other version)An application of kripke's completeness theorem for intuitionism to superconstructive propositional calculi.J. G. Anderson - 1969 - Mathematical Logic Quarterly 15 (16‐18):259-288.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Free Spectra of Linear Equivalential Algebras.Katarzyna Slomczyńska - 2005 - Journal of Symbolic Logic 70 (4):1341 - 1358.
    We construct the finitely generated free algebras and determine the free spectra of varieties of linear equivalential algebras and linear equivalential algebras of finite height corresponding. respectively, to the equivalential fragments of intermediate Gödel-Dummett logic and intermediate finite-valued logics of Gödel. Thus we compute the number of purely equivalential propositional formulas in these logics in n variables for an arbitrary n ∈ N.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Some results for implicational calculi.R. A. Bull - 1964 - Journal of Symbolic Logic 29 (1):33-39.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Proof of structural completeness of a certain class of implicative propositional calculi.Tadeusz Prucnal - 1973 - Studia Logica 32 (1):93 - 97.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • (1 other version)An algebraic approach to intuitionistic connectives.Xavier Caicedo & Roberto Cignoli - 2001 - Journal of Symbolic Logic 66 (4):1620-1636.
    It is shown that axiomatic extensions of intuitionistic propositional calculus defining univocally new connectives, including those proposed by Gabbay, are strongly complete with respect to valuations in Heyting algebras with additional operations. In all cases, the double negation of such a connective is equivalent to a formula of intuitionistic calculus. Thus, under the excluded third law it collapses to a classical formula, showing that this condition in Gabbay's definition is redundant. Moreover, such connectives can not be interpreted in all Heyting (...)
    Download  
     
    Export citation  
     
    Bookmark   20 citations  
  • Infinitary equilibrium logic and strongly equivalent logic programs.Amelia Harrison, Vladimir Lifschitz, David Pearce & Agustín Valverde - 2017 - Artificial Intelligence 246 (C):22-33.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Structural completeness of Gödel's and Dummett's propositional calculi.Wojciech Dzik & Andrzej Wroński - 1973 - Studia Logica 32 (1):69-73.
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  • Propositional Logics Related to Heyting's and Johansson's.Krister Segerberg - 1968 - Theoria 34 (1):26-61.
    Download  
     
    Export citation  
     
    Bookmark   54 citations