Switch to: Citations

Add references

You must login to add references.
  1. 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  
  • Logics without the contraction rule.Hiroakira Ono & Yuichi Komori - 1985 - Journal of Symbolic Logic 50 (1):169-201.
    Download  
     
    Export citation  
     
    Bookmark   93 citations  
  • Residuation, structural rules and context freeness.Gerhard Jäger - 2004 - Journal of Logic, Language and Information 13 (1):47-59.
    The article presents proofs of the context freeness of a family of typelogical grammars, namely all grammars that are based on a uni- ormultimodal logic of pure residuation, possibly enriched with thestructural rules of Permutation and Expansion for binary modes.
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Completeness Results for Lambek Syntactic Calculus.Wojciech Buszkowski - 1986 - Mathematical Logic Quarterly 32 (1-5):13-28.
    Download  
     
    Export citation  
     
    Bookmark   25 citations  
  • Powerset residuated algebras and generalized Lambek calculus.Miroslawa Kolowska-Gawiejnowicz - 1997 - Mathematical Logic Quarterly 43 (1):60-72.
    We prove a representation theorem for residuated algebras: each residuated algebra is isomorphically embeddable into a powerset residuated algebra. As a consequence, we obtain a completeness theorem for the Generalized Lambek Calculus. We use a Labelled Deductive System which generalizes the one used by Buszkowski [4] and Pankrat'ev [17] in completeness theorems for the Lambek Calculus.
    Download  
     
    Export citation  
     
    Bookmark   7 citations