On the Expressive Power of Monotone Natural Language Quantifiers over Finite Models

We study definability in terms of monotone generalized quantifiers satisfying Isomorphism closure, Conservativity and Extension. Among the quantifiers with the latter three properties — here called CE quantifiers — one finds the interpretations of determiner phrases in natural languages. The property of monotonicity is also linguistically ubiquitous, though some determiners like an even number of are highly non-monotone. They are nevertheless definable in terms of monotone CE quantifiers: we give a necessary and sufficient condition for such definability. We further identify a stronger form of monotonicity, called smoothness, which also has linguistic relevance, and we extend our considerations to smooth quantifiers. The results lead us to propose two tentative universals concerning monotonicity and natural language quantification. The notions involved as well as our proofs are presented using a graphical representation of quantifiers in the so-called number triangle.