Definition:Universal Quantifier
Definition
The symbol $\forall$ is called the universal quantifier.
It expresses the fact that, in a particular universe of discourse, all objects have a particular property.
That is:
- $\forall x:$
means:
- For all objects $x$, it is true that ...
In the language of set theory, this can be formally defined:
- $\forall x \in S: \map P x := \set {x \in S: \map P x} = S$
where $S$ is some set and $\map P x$ is a propositional function on $S$.
Propositional Expansion
The universal quantifier can be considered as a repeated conjunction:
Suppose our universe of discourse consists of the objects $\mathbf X_1, \mathbf X_2, \mathbf X_3, \ldots$ and so on.
Let $\forall$ be the universal quantifier.
What $\forall x: \map P x$ means is:
- $\mathbf X_1$ has property $P$, and $\mathbf X_2$ has property $P$, and $\mathbf X_3$ has property $P$, and ...
This translates into propositional logic as:
- $\map P {\mathbf X_1} \land \map P {\mathbf X_2} \land \map P {\mathbf X_3} \land \ldots$
This expression of $\forall x$ as a conjunction is known as the propositional expansion of $\forall x$.
The propositional expansion for the universal quantifier can exist in actuality only when the number of objects in the universe is finite.
If the universe is infinite, then the propositional expansion can exist only conceptually, and the universal quantifier cannot be eliminated.
Also see
- Results about the Universal Quantifier can be found here.
Notational Variants
Various symbols are encountered that denote the concept of universal quantifier:
Symbol | Origin |
---|---|
$\forall x$ | Gerhard Gentzen: Untersuchungen über das logische Schließen (1935) |
$\paren x$ | 1910: Alfred North Whitehead and Bertrand Russell: Principia Mathematica |
$\Pi x$ | Łukasiewicz's Polish notation |
$\wedge x$ or $\bigwedge x$ | |
$\ds \operatorname{\Large {\textsf A} } \limits_{x, y, \dotsc}$ | 1946: Alfred Tarski: Introduction to Logic and to the Methodology of Deductive Sciences |
Historical Note
The symbol $\forall$ for the universal quantifier was first used by Gerhard Karl Erich Gentzen in 1935: Untersuchungen über das logische Schließen. II (Math. Z. Vol. 39 (3): pp. 405 – 431).
He invented it in analogy with the existential quantifier symbol $\exists$ which he borrowed from Bertrand Russell.
Russell himself used the notation $\paren x$ for for all $x$. See his 1908: Mathematical Logic as Based on the Theory of Types (Amer. J. Math. Vol. 30: pp. 222 – 262).
Sources
- 1908: Bertrand Russell: Mathematical Logic as Based on the Theory of Types (Amer. J. Math. Vol. 30: pp. 222 – 262)
- 1935: Gerhard Gentzen: Untersuchungen über das logische Schließen. II (Math. Z. Vol. 39, no. 3: pp. 405 – 431)
- 1946: Alfred Tarski: Introduction to Logic and to the Methodology of Deductive Sciences (2nd ed.) ... (previous) ... (next): $\S 1.4$: Universal and Existential Quantifiers
- 1960: Paul R. Halmos: Naive Set Theory ... (previous) ... (next): $\S 2$: The Axiom of Specification
- 1964: Donald Kalish and Richard Montague: Logic: Techniques of Formal Reasoning ... (previous) ... (next): $\text{III}$: 'ALL' and 'SOME': $\S 1$
- 1972: A.G. Howson: A Handbook of Terms used in Algebra and Analysis ... (previous) ... (next): $\S 1$: Some mathematical language: Variables and quantifiers
- 1972: Patrick Suppes: Axiomatic Set Theory (2nd ed.) ... (previous) ... (next): $\S 1.2$ Logic and Notation
- 1973: Irving M. Copi: Symbolic Logic (4th ed.) ... (previous) ... (next): $4$: Propositional Functions and Quantifiers: $4.1$: Singular Propositions and General Propositions
- 1975: T.S. Blyth: Set Theory and Abstract Algebra ... (previous) ... (next): $\S 4$. Relations; functional relations; mappings
- 1978: Thomas A. Whitelaw: An Introduction to Abstract Algebra ... (previous) ... (next): $\S 3$: Statements and conditions; quantifiers
- 1980: D.J. O'Connor and Betty Powell: Elementary Logic ... (previous) ... (next): $\S \text{III}$: The Logic of Predicates $(1): \ 3$: Quantifiers: $\text{(ii)}$
- 1982: P.M. Cohn: Algebra Volume 1 (2nd ed.) ... (previous) ... (next): Chapter $1$: Sets and mappings: $\S 1.1$: The need for logic
- 1989: Ephraim J. Borowski and Jonathan M. Borwein: Dictionary of Mathematics ... (previous) ... (next): universal quantifier
- 1993: Keith Devlin: The Joy of Sets: Fundamentals of Contemporary Set Theory (2nd ed.) ... (previous) ... (next): $\S 1$: Naive Set Theory: $\S 1.1$: What is a Set?
- 1996: H. Jerome Keisler and Joel Robbin: Mathematical Logic and Computability: $\S 2.1$
- 1998: David Nelson: The Penguin Dictionary of Mathematics (2nd ed.) ... (previous) ... (next): quantifier
- 1998: David Nelson: The Penguin Dictionary of Mathematics (2nd ed.) ... (previous) ... (next): universal quantifier
- 1999: András Hajnal and Peter Hamburger: Set Theory ... (previous) ... (next): $1$. Notation, Conventions
- 2008: David Joyner: Adventures in Group Theory (2nd ed.) ... (previous) ... (next): Chapter $1$: Elementary, my dear Watson: $\S 1.1$: You have a logical mind if...: Definition $1.1.1$
- 2008: David Nelson: The Penguin Dictionary of Mathematics (4th ed.) ... (previous) ... (next): quantifier
- 2008: David Nelson: The Penguin Dictionary of Mathematics (4th ed.) ... (previous) ... (next): universal quantifier
- 2010: Raymond M. Smullyan and Melvin Fitting: Set Theory and the Continuum Problem (revised ed.) ... (previous) ... (next): Chapter $1$: General Background: $\S 6$ Significance of the results