Switch to: References

Add citations

You must login to add citations.
  1. Introduction.Christian Retoré - 1998 - Journal of Logic, Language and Information 7 (4):395-398.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  • Linguistic applications of first order intuitionistic linear logic.Richard Moot & Mario Piazza - 2001 - Journal of Logic, Language and Information 10 (2):211-232.
    In this paper we will discuss the first order multiplicative intuitionistic fragment of linear logic, MILL1, and its applications to linguistics. We give an embedding translation from formulas in the Lambek Calculus to formulas in MILL1 and show this translation is sound and complete. We then exploit the extra power of the first order fragment to give an account of a number of linguistic phenomena which have no satisfactory treatment in the Lambek Calculus.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • On the Recognizing Power of the Lambek Calculus with Brackets.Makoto Kanazawa - 2018 - Journal of Logic, Language and Information 27 (4):295-312.
    Every language recognized by the Lambek calculus with brackets is context-free. This is shown by combining an observation by Jäger with an entirely straightforward adaptation of the method Pentus used for the original Lambek calculus. The case of the variant of the calculus allowing sequents with empty antecedents is slightly more complicated, requiring a restricted use of the multiplicative unit.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Computing interpolants in implicational logics.Makoto Kanazawa - 2006 - Annals of Pure and Applied Logic 142 (1):125-201.
    I present a new syntactical method for proving the Interpolation Theorem for the implicational fragment of intuitionistic logic and its substructural subsystems. This method, like Prawitz’s, works on natural deductions rather than sequent derivations, and, unlike existing methods, always finds a ‘strongest’ interpolant under a certain restricted but reasonable notion of what counts as an ‘interpolant’.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Parsing Pregroup Grammars and Lambek Calculus Using Partial Composition.Denis Béchet - 2007 - Studia Logica 87 (2-3):199-224.
    The paper presents a way to transform pregroup grammars into contextfree grammars using functional composition. The same technique can also be used for the proof-nets of multiplicative cyclic linear logic and for Lambek calculus allowing empty premises.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • Dependency grammar.Geert-Jan M. Kruijff - 2006 - In Encyclopedia of Language and Linguistics. pp. 444--450.