Combinators and categorial grammar (Q1264141)

The paper searches for means to extend the possibilities of categorial grammars to eliminate bound variables from a language which allows both higher-order quantification and multi-place functors. Special attention is given to Leśniewskian languages. Given a Leśniewskian language L, the author defines a complete extension of L by 7 combinators in such a way that the following theorem holds: Every combinator-free wfe of an extended Leśniewskian language is equivalent to a wfe which contains neither quantifiers nor variables which are bound in that wfe. The paper ends with a discussion of the problems of adopting this approach to a categorical grammar in which there are type-change rules.