Lambek Grammars Based on Pregroups

Lambek [13] introduces pregroups as a new framework for syntactic structure. In this paper we prove some new theorems on pregroups and study grammars based on the calculus of free pregroups. We prove that these grammars are equivalent to context-free grammars. We also discuss the relation of pregroups to the Lambek calculus.

• Type: Conference
• Year: 2001
• Where: LACL
• Authors: Wojciech Buszkowski
• Keywords: Automated Reasoning, Context-free Grammars, LACL 2001, Study Grammars, Syntactic Structure