n. (Logic) a quantifier regarded as ranging over the extension of a predicate rather than over the entire domain of a logical theory. For example, predicate calculus standardly treats as equivalent to and writes (∀x) Rx → Bx (with the obvious translation scheme); however, Hempel's paradox suggests that non-ravens are irrelevant to the truth conditions of such a statement, and so that it might better be treated as quantifying only over those entities that satisfy the subject term. We might then write this as (∀_Rx)Bx. Similarly, it is clear that is not equivalent to since the latter will be true if an absolute majority of the domain are not A, no matter what their relation to the Bs; thus logics of plurality require restricted quantification.