Journal of Logic, Language and Information

, Volume 17, Issue 2, pp 141–160

Pregroup Grammars and Chomsky’s Earliest Examples


DOI: 10.1007/s10849-007-9053-2

Cite this article as:
Lambek, J. J of Log Lang and Inf (2008) 17: 141. doi:10.1007/s10849-007-9053-2


Pregroups are partially ordered monoids in which each element has two “adjoints”. Pregroup grammars provide a computational approach to natural languages by assigning to each word in the mental dictionary a type, namely an element of the pregroup freely generated by a partially ordered set of basic types. In this expository article, the attempt is made to introduce linguists to a pregroup grammar of English by looking at Chomsky’s earliest examples.


Computational linguisticsCategorial grammarsPregroup grammars

Copyright information

© Springer Science+Business Media B.V. 2008

Authors and Affiliations

  1. 1.Department of MathematicsMcGill UniversityMontrealCanada