We provide an algorithm for determining a categorial grammar from linguistic data that essentially uses unification of type-schemes assigned to atoms.Expand

We prove that the equational theory of *-continuous action algebras is not recursively enumerable and they possess FMP, but action logic does not.Expand

We prove that categorial grammars based on Nonassociative Lambek Calculus based on DFNL, also enriched with assumptions, generate context-free languages.Expand

Suite de l'article du meme A.: "Compatibility of a categorial grammar with an associated category system" (ibid., 1982, vol. 28, p. 229-238). L'A. expose trois resultats concernant les grammaires… Expand

L'A. montre que la grammaire categorielle de J. Lambek presente une nette superiorite par rapport a ses rivales, et examine les grammaires categorielles du point de vue de leur completude.

A residuated algebra is a generalization of a residuated groupoid; instead of one basic binary operation · with residual operations \, /, it admits finitely many basic operations, and each n−ary basic operation is associated with n residual operations.Expand