The equivalence of Nonassociative Lambek Categorial Grammars and Context-Free Grammars

✍ Scribed by Maciej Kandulski

• Publisher: John Wiley and Sons
• Year: 1988
• Tongue: English
• Weight: 699 KB
• Volume: 34
• Category: Article
• ISSN: 0044-3050
• DOI: 10.1002/malq.19880340106

✦ Synopsis

Besides this introduction the paper contains four sections. I n section 1 we describe three equivalent axiomatizations of NLP. the third one playing important role in what follows. I n section 2 we deal with a system AC: (the Ajdukiewicz calculus with product) and prove the equivalence of AC-grammars and CF-grammars. Section 3 provides the key lemma, concerning so-called normal derivations. The main equivalence theorem is proved in section 4; we establish the equivalence of categorial grammars based on NLP (in its third form L) and AC-grammars, and use the result of section 2. open (see [51, P I , [W).