论文信息 - Lambek Grammars Based on Pregroups

Lambek Grammars Based on Pregroups

Lambek [14] introduces pregroups as a new framework for syntactic structure. In this paper we prove some new theorems on pre-groups 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.

Wojciech Buszkowski | W. Buszkowski

[1] Mati Pentus,et al. Lambek grammars are context free , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

[2] Joachim Lambek,et al. Type Grammar Revisited , 1997, LACL.

[3] Wojciech Buszkowski,et al. Mathematical Linguistics and Proof Theory , 1997, Handbook of Logic and Language.

[4] Wojciech Buszkowski,et al. Generative capacity of nonassociative Lambek calculus , 1986 .

[5] Wojciech Buszkowski,et al. Extending Lambek grammars to basic categorial grammars , 1996, J. Log. Lang. Inf..

[6] Maciej Kandulski. The equivalence of Nonassociative Lambek Categorial Grammars and Context-Free Grammars , 1988, Math. Log. Q..

[7] Johan van Benthem,et al. The Lambek Calculus , 1988 .

[8] J. Lambek. The Mathematics of Sentence Structure , 1958 .

[9] Seymour Ginsburg,et al. The mathematical theory of context free languages , 1966 .

[10] Johan van Benthem,et al. Handbook of Logic and Language , 1996 .

[11] Wojciech Buszkowski. Completeness Results for Lambek Syntactic Calculus , 1986, Math. Log. Q..