Strong Equivalence of Generalized Ajdukiewicz and Lambek Grammars

摘要

We consider Ajdukiewicz and Lambek syntactic calculi based on an algebra of arbitrary syntactic operations and prove that categorial grammars employing both of those calculi as type reduction systems generate the same class of phrase languages.