We define a correct and complete recognition and parsing algorithm for pregroup grammars and give sufficient conditions for the algorithm to run in linear time.Expand

Every pregroup grammar is shown to be strongly equivalent to one which uses basic types and left and right adjoints of basic types only. Therefore a semantical interpretation is independent of the… Expand

A pregroup grammar is presented which handles distant agreement of features in French, including modal verbs, relative pronouns, clitics, the compound past and the passive mode.Expand

It is long known that Lawvere's theory in The category of categories as foundations of mathematics A[1] does not work, as indicated in Ishell's review [0].Expand