Lambek grammars as combinatory categorial grammars

Logic Journal of the IGPL 9 (6):781-792 (2001)
  Copy   BIBTEX

Abstract

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

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,440

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

JM Cohen's claim on categorial grammars remains unproved.Wojciech Zielonka - 1985 - Bulletin of the Section of Logic 14 (4):130-133.
Product-free Lambek calculus and context-free grammars.Mati Pentus - 1997 - Journal of Symbolic Logic 62 (2):648-660.
Extending Lambek grammars to basic categorial grammars.Wojciech Buszkowski - 1996 - Journal of Logic, Language and Information 5 (3-4):279-295.

Analytics

Added to PP
2015-02-04

Downloads
17 (#852,234)

6 months
15 (#159,740)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references