Quantifiers

Precise definition

A predicate $P(x)$ becomes a proposition when its variables are bound. The universal statement $\forall x\in D\,P(x)$ says $P$ holds for every element of domain $D$; the existential statement $\exists x\in D\,P(x)$ says at least one element of $D$ satisfies it. The uniqueness quantifier $\exists!x$ asserts exactly one.

Notation and mathematical language

Quantifier scope determines which formula is governed. Negations switch quantifiers: $\neg\forall x\,P(x)\equiv\exists x\,\neg P(x)$ and $\neg\exists x\,P(x)\equiv\forall x\,\neg P(x)$. Order matters: $\forall x\exists y$ permits $y$ to depend on $x$, while $\exists y\forall x$ demands one $y$ work for all $x$.

Conceptual picture

Quantifiers encode a game of choices. In $\forall x\exists y$, an opponent chooses $x$ and then you may respond with a suitable $y$. In $\exists y\forall x$, you must choose one $y$ before seeing any $x$, a much stronger requirement.

Fully worked example

Interpretation and application

Quantifiers specify database constraints, function properties, limits, and software requirements. 'Every request eventually receives some response' differs from 'there is one response suitable for every request'; precise scope prevents an implementation from satisfying the wrong requirement.

Common mistakes