Abstract
Pregroups are introduced by Lambek [8] as a framework for syntactic analysis of Natural Language; they are algebraic models of Compact Bilinear Logic. In the present paper we consider the problem of conjoinability in the calculus of pregroups. We show that two types are conjoinable in a pregroup iff they are equal in a free group. This result is analogous to Pentus' characterization of conjoinability in the Lambek calculus [11].
Get full access to this article
View all access options for this article.