A semantic constraint on binary determiners

Richard Zuber (1)

1 LLF UMR7110 - Laboratoire de Linguistique Formelle

A type <1,1> quantifier F is symmetric iff F(X, X)(Y ) = F(Y, Y )(X). 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: ACL

Domaines: Linguistique

Richard Zuber. A semantic constraint on binary determiners. Linguistic and Philosophy, 2009, 32, pp.95-114. ⟨halshs-00746302⟩