A faithful representation of non-associative Lambek grammars in abstract categorial grammars

Journal of Logic Language and Information 19 (2):185-200 (2010)
  Copy   BIBTEX

Abstract

This paper solves a natural but still open question: can abstract categorial grammars (ACGs) respresent usual categorial grammars? Despite their name and their claim to be a unifying framework, up to now there was no faithful representation of usual categorial grammars in ACGs. This paper shows that Non-Associative Lambek grammars as well as their derivations can be defined using ACGs of order two. To conclude, the outcome of such a representation are discussed.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 94,045

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

Analytics

Added to PP
2010-01-13

Downloads
52 (#299,043)

6 months
11 (#338,924)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

Proofs and types.Jean-Yves Girard - 1989 - New York: Cambridge University Press.
Mathematical linguistics and proof theory.Wojciech Buszkowski - 1997 - In J. F. A. K. Van Benthem, Johan van Benthem & Alice G. B. Ter Meulen (eds.), Handbook of Logic and Language. Elsevier. pp. 683--736.
Lambda Grammars and the Syntax-Semantics Interface.Reinhard Muskens - 2001 - In Robert Van Rooij & Martin Stokhof (eds.), Proceedings of the Thirteenth Amsterdam Colloquium. Amsterdam: ILLC. pp. 150-155.

Add more references