Journal of Symbolic Logic 62 (2):648-660 (1997)

In this paper we prove the Chomsky Conjecture (all languages recognized by the Lambek calculus are context-free) for both the full Lambek calculus and its product-free fragment. For the latter case we present a construction of context-free grammars involving only product-free types
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2275553
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 62,496
Through your library

References found in this work BETA

Language in Action.Johan Van Benthem - 1991 - Journal of Philosophical Logic 20 (3):225-263.
The Equivalence of Unidirectional Lambek Categorial Grammars and Context-Free Grammars.Wojcßch Buszkowski - 1985 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 31 (24):369-384.

Add more references

Citations of this work BETA

On the Recognizing Power of the Lambek Calculus with Brackets.Makoto Kanazawa - 2018 - Journal of Logic, Language and Information 27 (4):295-312.
Computing Interpolants in Implicational Logics.Makoto Kanazawa - 2006 - Annals of Pure and Applied Logic 142 (1):125-201.

Add more citations

Similar books and articles


Added to PP index

Total views
33 ( #327,272 of 2,446,314 )

Recent downloads (6 months)
1 ( #456,608 of 2,446,314 )

How can I increase my downloads?


My notes