Switch to: Citations

Add references

You must login to add references.
  1. Adding involution to residuated structures.Nikolaos Galatos & James G. Raftery - 2004 - Studia Logica 77 (2):181 - 207.
    Two constructions for adding an involution operator to residuated ordered monoids are investigated. One preserves integrality and the mingle axiom x 2x but fails to preserve the contraction property xx 2. The other has the opposite preservation properties. Both constructions preserve commutativity as well as existent nonempty meets and joins and self-dual order properties. Used in conjunction with either construction, a result of R.T. Brady can be seen to show that the equational theory of commutative distributive residuated lattices (without involution) (...)
    Download  
     
    Export citation  
     
    Bookmark   25 citations  
  • (1 other version)A truth value semantics for modal logic.J. Michael Dunn - 1973 - Journal of Symbolic Logic 42 (2):87--100.
    Download  
     
    Export citation  
     
    Bookmark   16 citations  
  • The finite model property for various fragments of intuitionistic linear logic.Mitsuhiro Okada & Kazushige Terui - 1999 - Journal of Symbolic Logic 64 (2):790-802.
    Recently Lafont [6] showed the finite model property for the multiplicative additive fragment of linear logic (MALL) and for affine logic (LLW), i.e., linear logic with weakening. In this paper, we shall prove the finite model property for intuitionistic versions of those, i.e. intuitionistic MALL (which we call IMALL), and intuitionistic LLW (which we call ILLW). In addition, we shall show the finite model property for contractive linear logic (LLC), i.e., linear logic with contraction, and for its intuitionistic version (ILLC). (...)
    Download  
     
    Export citation  
     
    Bookmark   25 citations  
  • Algebraic aspects of cut elimination.Francesco Belardinelli, Peter Jipsen & Hiroakira Ono - 2004 - Studia Logica 77 (2):209 - 240.
    We will give here a purely algebraic proof of the cut elimination theorem for various sequent systems. Our basic idea is to introduce mathematical structures, called Gentzen structures, for a given sequent system without cut, and then to show the completeness of the sequent system without cut with respect to the class of algebras for the sequent system with cut, by using the quasi-completion of these Gentzen structures. It is shown that the quasi-completion is a generalization of the MacNeille completion. (...)
    Download  
     
    Export citation  
     
    Bookmark   22 citations  
  • Gentzenization and decidability of some contraction-less relevant logics.Ross T. Brady - 1991 - Journal of Philosophical Logic 20 (1):97 - 117.
    Download  
     
    Export citation  
     
    Bookmark   17 citations  
  • TW+ and RW+ are decidable.Steve Giambrone - 1985 - Journal of Philosophical Logic 14 (3):235 - 254.
    Download  
     
    Export citation  
     
    Bookmark   23 citations