Journal of Symbolic Logic

Product-Free Lambek Calculus and Context-Free Grammars

Mati Pentus

Full-text is available via JSTOR, for JSTOR subscribers. Go to this article in JSTOR.

Abstract

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.

Article information

Source
J. Symbolic Logic, Volume 62, Issue 2 (1997), 648-660.

Dates
First available in Project Euclid: 6 July 2007

Permanent link to this document
https://projecteuclid.org/euclid.jsl/1183745249

Mathematical Reviews number (MathSciNet)
MR1464119

Zentralblatt MATH identifier
0882.68084

JSTOR
links.jstor.org

Citation

Pentus, Mati. Product-Free Lambek Calculus and Context-Free Grammars. J. Symbolic Logic 62 (1997), no. 2, 648--660. https://projecteuclid.org/euclid.jsl/1183745249


Export citation