“…In the quantifier literature, different ways to decide what should be considered a quantifier have been proposed, as have different classifications of quantifiers. Quantifiers can be divided with respect to their linguistic properties (A‐ and D‐quantifiers), logical definability (first‐order, e.g., “all” or “some” vs. higher‐order quantifiers, e.g., “most”), computational complexity (e.g., recognizable by finite‐automata, like “all,” or not recognizable by finite‐automata, like “an even number of”), historical reasons (e.g., distinguishing Aristotelian quantifiers “all,” “some,” “not all,” “some not”), or even combinations of these various criteria (e.g., Barwise & Cooper, 1981; Keenan, 2012; Partee, 1995; Szymanik, 2016). All these classifications turned out to be very useful in understanding the formal properties of quantifiers, formulating quantifier theories, and empirical predictions about quantifier distribution or processing.…”