A semantic constraint on binary determiners
Résumé
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.
Domaines
Linguistique
Origine : Fichiers produits par l'(les) auteur(s)
Loading...