Universal Quantifier

logic

Definition

Universal Quantifier

The universal quantifier, denoted by the symbol $\forall$, is a quantifier used in logic to express that a property or predicate holds for all elements in the domain of discourse.

A formula $\forall xF$ is true if and only if $F$ is true for every possible value assigned to $x$ from the universe.

Semantics

Formally, the semantics are defined using an interpretation $I$ and a variable assignment $\sigma$. The valuation function ${\mathrm{val}}_{I,\sigma }$ for a universally quantified formula is:

$${\mathrm{val}}_{I,\sigma }(\forall xF)=\{\begin{array}{ll}1& \text{if for all }{\sigma }^{\prime }\stackrel{x}{\sim }\sigma \text{ it holds that }{\mathrm{val}}_{I,{\sigma }^{\prime }}(F)=1\\ 0& \text{otherwise}\end{array}$$

where ${\sigma }^{\prime }\stackrel{x}{\sim }\sigma$ denotes a variable assignment that is identical to $\sigma$ except possibly for the value assigned to $x$.

Relation to Existential Quantifier

The universal quantifier is the dual of the existential quantifier ($\exists$). They are related by De Morgan’s laws for quantifiers:

$$\begin{array}{rl}\forall xF& \equiv \neg \exists x\neg F\\ \neg \forall xF& \equiv \exists x\neg F\end{array}$$

Empty Domains

In a universe that is empty, any universally quantified statement is vacuously true, while any existentially quantified statement is false. However, in standard first-order logic, the domain of discourse is usually assumed to be non-empty.