Product-free Lambek calculus and context-free grammars

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
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 23,201
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA
Wojcßch Buszkowski (1985). The Equivalence of Unidirectional Lambek Categorial Grammars and Context-Free Grammars. Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 31 (24):369-384.

Add more references

Citations of this work BETA
Makoto Kanazawa (2006). Computing Interpolants in Implicational Logics. Annals of Pure and Applied Logic 142 (1):125-201.

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

22 ( #213,240 of 1,940,956 )

Recent downloads (6 months)

1 ( #457,978 of 1,940,956 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.