Skip Navigation

Logic Journal of IGPL 2001 9(6):781-792; doi:10.1093/jigpal/9.6.781
© 2001 by Oxford University Press
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Jäger, G
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Lambek grammars as combinatory categorial grammars

G Jäger

Zentrum für Allgemeine Sprachwissenschaft (ZAS), Jägerstr. 10/11, 10117 Berlin, Germany E-mail: jaeger@zas.gwz-berlin.de

We propose a combinatory reformulation of the product free version of the categorial calculus LL, i.e. the associative Lambek calculus that admits empty premises. We prove equivalence of the combinatory with the standard Natural Deduction presentation of LL. The result offers a new perspective on the relation between the type logical and the combinatory branch of the Categorial Grammar research program.

Key Words: Categorial Grammars, Lambek Calculus, CCG


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.