A semantic constraint on binary determiners

R. Zuber (1)

1 LLF UMR7110 - Laboratoire de Linguistique Formelle

A type quantifier is symmetric iff ()() = ()(). It is shown that quantifiers denoted by irreducible binary determiners in natural languages are both conservative and symmetric and not only conservative.

Mots clés: Binary determiners; Higher type quantifiers; Symmetry; Language universals

R. Zuber. A semantic constraint on binary determiners. Linguistics and Philosophy, 2009, 32 (1), pp.95-114. ⟨10.1007/s10988-009-9053-6⟩. ⟨hal-00535501⟩