In

^{2}.
This is clearly true; it just asserts that every natural number has a square. The meaning of the assertion in which the order of quantifiers is inversed is different:
:There exists a natural number ''s'' such that for every natural number ''n'', ''s'' = ''n''^{2}.
This is clearly false; it asserts that there is a single natural number ''s'' that is the square of ''every'' natural number. This is because the syntax directs that any variable cannot be a function of subsequently introduced variables.
A less trivial example from ^{2} satisfies pointwise, but not uniform continuity (its slope is unbound).
In contrast, interchanging the two initial universal quantifiers in the definition of pointwise continuity does not change the meaning.
As a general rule, swapping two adjacent universal quantifiers with the same scope (or swapping two adjacent existential quantifiers with the same scope) doesn't change the meaning of the formula (see Example here), but swapping an existential quantifier and an adjacent universal quantifier may change its meaning.
The maximum depth of nesting of quantifiers in a formula is called its " quantifier rank".

_{1}, ..., ''x''_{n} is interpreted as a boolean-valued function ''F''(''v''_{1}, ..., ''v''_{''n''}) of ''n'' arguments, where each argument ranges over the domain ''X''. Boolean-valued means that the function assumes one of the values T (interpreted as truth) or F (interpreted as falsehood). The interpretation of the formula
:$\backslash forall\; x\_n\; A(x\_1,\; \backslash ldots\; ,\; x\_n)$
is the function ''G'' of ''n''-1 arguments such that ''G''(''v''_{1}, ..., ''v''_{''n''-1}) = T if and only if ''F''(''v''_{1}, ..., ''v''_{''n''-1}, ''w'') = T for every ''w'' in ''X''. If ''F''(''v''_{1}, ..., ''v''_{''n''-1}, ''w'') = F for at least one value of ''w'', then ''G''(''v''_{1}, ..., ''v''_{''n''-1}) = F. Similarly the interpretation of the formula
:$\backslash exists\; x\_n\; A(x\_1,\; \backslash ldots\; ,\; x\_n)$
is the function ''H'' of ''n''-1 arguments such that ''H''(''v''_{1}, ..., ''v''_{''n''-1}) = T if and only if ''F''(''v''_{1}, ..., ''v''_{''n''-1}, ''w'') = T for at least one ''w'' and ''H''(''v''_{1}, ..., ''v''_{''n''-1}) = F otherwise.
The semantics for uniqueness quantification requires first-order predicate calculus with equality. This means there is given a distinguished two-placed predicate "="; the semantics is also modified accordingly so that "=" is always interpreted as the two-place equality relation on ''X''. The interpretation of
:$\backslash exists\; !\; x\_n\; A(x\_1,\; \backslash ldots\; ,\; x\_n)$
then is the function of ''n''-1 arguments, which is the logical ''and'' of the interpretations of
:$\backslash exists\; x\_n\; A(x\_1,\; \backslash ldots\; ,\; x\_n)$
:$\backslash forall\; y,z\; \backslash big(\; A(x\_1,\; \backslash ldots\; ,x\_,\; y)\; \backslash wedge\; A(x\_1,\; \backslash ldots\; ,x\_,\; z)\; \backslash implies\; y\; =\; z\; \backslash big).$
Each kind of quantification defines a corresponding ^{''n''}+''y''^{''n''}=''z''^{''n''} is the closed formula ∃''n'' ∃''x'' ∃''y'' ∃''z'' (''n''>2 ∧ ''x''^{''n''}+''y''^{''n''}=''z''^{''n''}); the latter formula, when interpreted over the natural numbers, is known to be false by Fermat's Last Theorem. As another example, equational axioms, like ''x''+''y''=''y''+''x'', are usually meant to denote their ''universal closure'', like ∀''x'' ∀''y'' (''x''+''y''=''y''+''x'') to express

_{1},...,''x''_{''n''} whose interpretation is
the function ''F'' of variables ''v''_{1},...,''v''_{''n''}
then the interpretation of
:$\backslash exists^\; x\_n\; A(x\_1,\; \backslash ldots,\; x\_,\; x\_n)$
is the function of ''v''_{1},...,''v''_{''n''-1} which is T if and only if
:$\backslash operatorname\; \backslash \; \backslash geq\; b$
and F otherwise. Similarly, the interpretation of
:$\backslash exists^\; x\_n\; A(x\_1,\; \backslash ldots,\; x\_,\; x\_n)$
is the function of ''v''_{1},...,''v''_{''n''-1} which is F if and only if
:$0<\; \backslash operatorname\; \backslash \; \backslash leq\; a$
and T otherwise.

^{2} ≤ 4 are in ." The same construct is expressible in

_{x} and Σ_{x} where we now write ∀''x'' and ∃''x''. Peirce's notation can be found in the writings of Ernst Schröder, Leopold Loewenheim, Thoralf Skolem, and Polish logicians into the 1950s. Most notably, it is the notation of Kurt Gödel's landmark 1930 paper on the completeness of

"Classical Logic"

(Covers syntax, model theory, and metatheory for first order logic in the natural deduction style.) ** Westerståhl, Dag (2005)

"Generalized quantifiers"

* Peters, Stanley; Westerståhl, Dag (2002)

"Quantifiers"

{{Authority control Logic Predicate logic Quantifier (logic) Philosophical logic Semantics

logic
Logic is the study of correct reasoning. It includes both formal and informal logic. Formal logic is the science of deductively valid inferences or of logical truths. It is a formal science investigating how conclusions follow from premise ...

, a quantifier is an operator that specifies how many individuals in the domain of discourse
In the formal sciences, the domain of discourse, also called the universe of discourse, universal set, or simply universe, is the set of entities over which certain variables of interest in some formal treatment may range.
Overview
The domain ...

satisfy an open formula. For instance, the universal quantifier
In mathematical logic, a universal quantification is a type of quantifier, a logical constant which is interpreted as "given any" or "for all". It expresses that a predicate can be satisfied by every member of a domain of discourse. In othe ...

$\backslash forall$ in the first order formula $\backslash forall\; x\; P(x)$ expresses that everything in the domain satisfies the property denoted by $P$. On the other hand, the existential quantifier
In predicate logic, an existential quantification is a type of quantifier, a logical constant which is interpreted as "there exists", "there is at least one", or "for some". It is usually denoted by the logical operator symbol ∃, which, w ...

$\backslash exists$ in the formula $\backslash exists\; x\; P(x)$ expresses that there exists something in the domain which satisfies that property. A formula where a quantifier takes widest scope is called a quantified formula. A quantified formula must contain a bound variable and a subformula specifying a property of the referent of that variable.
The mostly commonly used quantifiers are $\backslash forall$ and $\backslash exists$. These quantifiers are standardly defined as duals; in classical logic, they are interdefinable using negation
In logic, negation, also called the logical complement, is an operation that takes a proposition P to another proposition "not P", written \neg P, \mathord P or \overline. It is interpreted intuitively as being true when P is false, and fals ...

. They can also be used to define more complex quantifiers, as in the formula $\backslash neg\; \backslash exists\; x\; P(x)$ which expresses that nothing has the property $P$. Other quantifiers are only definable within second order logic or higher order logic
mathematics and logic, a higher-order logic is a form of predicate logic that is distinguished from first-order logic by additional quantifiers and, sometimes, stronger semantics. Higher-order logics with their standard semantics are more expre ...

s. Quantifiers have been generalized beginning with the work of Mostowski and Lindström.
In a first-order logic statement, quantifications in the same type (either universal quantifications or existential quantifications) can be exchanged without changing the meaning of the statement, while the exchange of quantifications in different types changes the meaning. As an example, the only difference in the definition of uniform continuity and (ordinary) continuity is the order of quantifications.
First order quantifiers approximate the meanings of some natural language
In neuropsychology, linguistics, and philosophy of language, a natural language or ordinary language is any language that has evolved naturally in humans through use and repetition without conscious planning or premeditation. Natural language ...

quantifiers such as "some" and "all". However, many natural language quantifiers can only be analyzed in terms of generalized quantifiers.
Relations to logical conjunction and disjunction

For a finite domain of discourse $D\; =\; \backslash $, the universally quantified formula $\backslash forall\; x\; \backslash in\; D\; \backslash ;\; P(x)$ is equivalent to thelogical conjunction
In logic, mathematics and linguistics, And (\wedge) is the truth-functional operator of logical conjunction; the ''and'' of a set of operands is true if and only if ''all'' of its operands are true. The logical connective that represents this ...

$P(a\_1)\; \backslash land\; ...\; \backslash land\; P(a\_n)$.
Dually, the existentially quantified formula $\backslash exists\; x\; \backslash in\; D\; \backslash ;\; P(x)$ is equivalent to the logical disjunction
In logic, disjunction is a logical connective typically notated as \lor and read aloud as "or". For instance, the English language sentence "it is raining or it is snowing" can be represented in logic using the disjunctive formula R \lor S ...

$P(a\_1)\; \backslash lor\; ...\; \backslash lor\; P(a\_n)$.
For example, if $B\; =\; \backslash $ is the set of binary digit
Binary may refer to:
Science and technology Mathematics
* Binary number, a representation of numbers using only two digits (0 and 1)
* Binary function, a function that takes two arguments
* Binary operation, a mathematical operation that t ...

s, the formula $\backslash forall\; x\; \backslash in\; B\; \backslash ;\; x\; =\; x^2$ abbreviates $0\; =\; 0^2\; \backslash land\; 1\; =\; 1^2$, which evaluates to ''true''.
Infinite domain of discourse

Consider the following statement (''using dot notation for multiplication''): : 1 · 2 = 1 + 1, and 2 · 2 = 2 + 2, and 3 · 2 = 3 + 3, ..., and 100 · 2 = 100 + 100, and ..., etc. This has the appearance of an ''infinite conjunction'' of propositions. From the point of view offormal language
In logic, mathematics, computer science, and linguistics, a formal language consists of words whose letters are taken from an alphabet and are well-formed according to a specific set of rules.
The alphabet of a formal language consists of sym ...

s, this is immediately a problem, since syntax
In linguistics, syntax () is the study of how words and morphemes combine to form larger units such as phrases and sentences. Central concerns of syntax include word order, grammatical relations, hierarchical sentence structure (constituency), ...

rules are expected to generate finite words.
The example above is fortunate in that there is a procedure to generate all the conjuncts. However, if an assertion were to be made about every irrational number
In mathematics, the irrational numbers (from in- prefix assimilated to ir- (negative prefix, privative) + rational) are all the real numbers that are not rational numbers. That is, irrational numbers cannot be expressed as the ratio of two inte ...

, there would be no way to enumerate all the conjuncts, since irrationals cannot be enumerated. A succinct, equivalent formulation which avoids these problems uses ''universal quantification'':
: For each natural number
In mathematics, the natural numbers are those numbers used for counting (as in "there are ''six'' coins on the table") and ordering (as in "this is the ''third'' largest city in the country").
Numbers used for counting are called ''cardinal n ...

''n'', ''n'' · 2 = ''n'' + ''n''.
A similar analysis applies to the disjunction
In logic, disjunction is a logical connective typically notated as \lor and read aloud as "or". For instance, the English language sentence "it is raining or it is snowing" can be represented in logic using the disjunctive formula R \lor S ...

,
: 1 is equal to 5 + 5, or 2 is equal to 5 + 5, or 3 is equal to 5 + 5, ... , or 100 is equal to 5 + 5, or ..., etc.
which can be rephrased using ''existential quantification'':
: For some natural number
In mathematics, the natural numbers are those numbers used for counting (as in "there are ''six'' coins on the table") and ordering (as in "this is the ''third'' largest city in the country").
Numbers used for counting are called ''cardinal n ...

''n'', ''n'' is equal to 5+5.
Algebraic approaches to quantification

It is possible to deviseabstract algebra
In mathematics, more specifically algebra, abstract algebra or modern algebra is the study of algebraic structures. Algebraic structures include groups, rings, fields, modules, vector spaces, lattices, and algebras over a field. The ter ...

s whose models include formal language
In logic, mathematics, computer science, and linguistics, a formal language consists of words whose letters are taken from an alphabet and are well-formed according to a specific set of rules.
The alphabet of a formal language consists of sym ...

s with quantification, but progress has been slow and interest in such algebra has been limited. Three approaches have been devised to date:
* Relation algebra, invented by Augustus De Morgan, and developed by Charles Sanders Peirce
Charles Sanders Peirce ( ; September 10, 1839 – April 19, 1914) was an American philosopher, logician, mathematician and scientist who is sometimes known as "the father of pragmatism".
Educated as a chemist and employed as a scientist for ...

, Ernst Schröder, Alfred Tarski, and Tarski's students. Relation algebra cannot represent any formula with quantifiers nested more than three deep. Surprisingly, the models of relation algebra include the axiomatic set theory ZFC and Peano arithmetic;
* Cylindric algebra, devised by Alfred Tarski, Leon Henkin, and others;
* The polyadic algebra of Paul Halmos
Paul Richard Halmos ( hu, Halmos Pál; March 3, 1916 – October 2, 2006) was a Hungarian-born American mathematician and statistician who made fundamental advances in the areas of mathematical logic, probability theory, statistics, operato ...

.
Notation

The two most common quantifiers are the universal quantifier and the existential quantifier. The traditional symbol for the universal quantifier is " ∀", a rotated letter " A", which stands for "for all" or "all". The corresponding symbol for the existential quantifier is " ∃", a rotated letter " E", which stands for "there exists" or "exists". An example of translating a quantified statement in a natural language such as English would be as follows. Given the statement, "Each of Peter's friends either likes to dance or likes to go to the beach (or both)", key aspects can be identified and rewritten using symbols including quantifiers. So, let ''X'' be the set of all Peter's friends, ''P''(''x'') thepredicate
Predicate or predication may refer to:
* Predicate (grammar), in linguistics
* Predication (philosophy)
* several closely related uses in mathematics and formal logic:
** Predicate (mathematical logic)
**Propositional function
** Finitary relation ...

"''x'' likes to dance", and ''Q''(''x'') the predicate "''x'' likes to go to the beach". Then the above sentence can be written in formal notation as $\backslash forallX,\; (P(x)\; \backslash lor\; Q(x))$, which is read, "for every ''x'' that is a member of ''X'', ''P'' applies to ''x'' or ''Q'' applies to ''x''".
Some other quantified expressions are constructed as follows,
: $\backslash exists\backslash ,\; P$ $\backslash forall\backslash ,\; P$
for a formula ''P''. These two expressions (using the definitions above) are read as "there exists a friend of Peter who likes to dance" and "all friends of Peter like to dance", respectively.
Variant notations include, for set ''X'' and set members ''x'':
: $\backslash bigvee\_\; P$ $(\backslash exists)\; P$ $(\backslash exists\; x\; \backslash \; .\; \backslash \; P)$ $\backslash exists\; x\; \backslash \; \backslash cdot\; \backslash \; P$ $(\backslash exists\; x\; :\; P)$ $\backslash exists(P)$ $\backslash exists\_\backslash ,\; P$ $\backslash exists\backslash ,\; P$ $\backslash existsX\; \backslash ,\; P$ $\backslash exists\backslash ,\; xX\; \backslash ,\; P$
All of these variations also apply to universal quantification.
Other variations for the universal quantifier are
: $\backslash bigwedge\_\; P$ $\backslash bigwedge\; x\; P$ $(x)\; \backslash ,\; P$
Some versions of the notation explicitly mention the range of quantification. The range of quantification must always be specified; for a given mathematical theory, this can be done in several ways:
* Assume a fixed domain of discourse for every quantification, as is done in Zermelo–Fraenkel set theory
In set theory, Zermelo–Fraenkel set theory, named after mathematicians Ernst Zermelo and Abraham Fraenkel, is an axiomatic system that was proposed in the early twentieth century in order to formulate a theory of sets free of paradoxes such ...

,
* Fix several domains of discourse in advance and require that each variable have a declared domain, which is the ''type'' of that variable. This is analogous to the situation in statically typed
In computer programming, a type system is a logical system comprising a set of rules that assigns a property called a type to every "term" (a word, phrase, or other set of symbols). Usually the terms are various constructs of a computer progra ...

computer programming
Computer programming is the process of performing a particular computation (or more generally, accomplishing a specific computing result), usually by designing and building an executable computer program. Programming involves tasks such as anal ...

languages, where variables have declared types.
* Mention explicitly the range of quantification, perhaps using a symbol for the set of all objects in that domain (or the type of the objects in that domain).
One can use any variable as a quantified variable in place of any other, under certain restrictions in which ''variable capture'' does not occur. Even if the notation uses typed variables, variables of that type may be used.
Informally or in natural language, the "∀''x''" or "∃''x''" might appear after or in the middle of ''P''(''x''). Formally, however, the phrase that introduces the dummy variable is placed in front.
Mathematical formulas mix symbolic expressions for quantifiers with natural language quantifiers such as,
: For every natural number ''x'', ...
: There exists an ''x'' such that ...
: For at least one ''x, ....''
Keywords for uniqueness quantification include:
: For exactly one natural number ''x'', ...
: There is one and only one ''x'' such that ....
Further, ''x'' may be replaced by a pronoun
In linguistics and grammar, a pronoun (abbreviated ) is a word or a group of words that one may substitute for a noun or noun phrase.
Pronouns have traditionally been regarded as one of the parts of speech, but some modern theorists would not ...

. For example,
:For every natural number, its product with 2 equals to its sum with itself.
:Some natural number is prime.
Order of quantifiers (nesting)

The order of quantifiers is critical to meaning, as is illustrated by the following two propositions: :For every natural number ''n'', there exists a natural number ''s'' such that ''s'' = ''n''mathematical analysis
Analysis is the branch of mathematics dealing with continuous functions, limits, and related theories, such as differentiation, integration, measure, infinite sequences, series, and analytic functions.
These theories are usually studied in ...

are the concepts of uniform and pointwise continuity, whose definitions differ only by an exchange in the positions of two quantifiers. A function ''f'' from R to R is called
* Pointwise continuous if $$\backslash forall\; \backslash varepsilon\; >\; 0\; \backslash ;\; \backslash forall\; x\; \backslash in\; \backslash R\; \backslash ;\; \backslash exists\; \backslash delta\; >\; 0\; \backslash ;\; \backslash forall\; h\; \backslash in\; \backslash R\; \backslash ;\; (,\; h,\; <\; \backslash delta\; \backslash ,\; \backslash Rightarrow\; \backslash ,\; ,\; f(x)\; -\; f(x\; +\; h),\; <\; \backslash varepsilon\; )$$
* Uniformly continuous if $$\backslash forall\; \backslash varepsilon\; >\; 0\; \backslash ;\; \backslash exists\; \backslash delta\; >\; 0\; \backslash ;\; \backslash forall\; x\; \backslash in\; \backslash R\; \backslash ;\; \backslash forall\; h\; \backslash in\; \backslash R\; \backslash ;\; (,\; h,\; <\; \backslash delta\; \backslash ,\; \backslash Rightarrow\; \backslash ,\; ,\; f(x)\; -\; f(x\; +\; h),\; <\; \backslash varepsilon\; )$$
In the former case, the particular value chosen for ''δ'' can be a function of both ''ε'' and ''x'', the variables that precede it.
In the latter case, ''δ'' can be a function only of ''ε'' (i.e., it has to be chosen independent of ''x''). For example, ''f''(''x'') = ''x''Equivalent expressions

If ''D'' is a domain of ''x'' and ''P''(''x'') is a predicate dependent on object variable ''x'', then the universal proposition can be expressed as :$\backslash forall\; x\backslash !\backslash in\backslash !D\backslash ;\; P(x).$ This notation is known as restricted or relativized or bounded quantification. Equivalently one can write, :$\backslash forall\; x\backslash ;(x\backslash !\backslash in\backslash !D\; \backslash to\; P(x)).$ The existential proposition can be expressed with bounded quantification as :$\backslash exists\; x\backslash !\backslash in\backslash !D\backslash ;\; P(x),$ or equivalently :$\backslash exists\; x\backslash ;(x\backslash !\backslash in\backslash !\backslash !D\; \backslash land\; P(x)).$ Together with negation, only one of either the universal or existential quantifier is needed to perform both tasks: :$\backslash neg\; (\backslash forall\; x\backslash !\backslash in\backslash !D\backslash ;\; P(x))\; \backslash equiv\; \backslash exists\; x\backslash !\backslash in\backslash !D\backslash ;\; \backslash neg\; P(x),$ which shows that to disprove a "for all ''x''" proposition, one needs no more than to find an ''x'' for which the predicate is false. Similarly, :$\backslash neg\; (\backslash exists\; x\backslash !\backslash in\backslash !D\backslash ;\; P(x))\; \backslash equiv\; \backslash forall\; x\backslash !\backslash in\backslash !D\backslash ;\; \backslash neg\; P(x),$ to disprove a "there exists an ''x''" proposition, one needs to show that the predicate is false for all ''x''. In classical logic, every formula is logically equivalent to a formula in prenex normal form, that is, a string of quantifiers and bound variables followed by a quantifier-free formula.Range of quantification

Every quantification involves one specific variable and adomain of discourse
In the formal sciences, the domain of discourse, also called the universe of discourse, universal set, or simply universe, is the set of entities over which certain variables of interest in some formal treatment may range.
Overview
The domain ...

or range of quantification of that variable. The range of quantification specifies the set of values that the variable takes. In the examples above, the range of quantification is the set of natural numbers. Specification of the range of quantification allows us to express the difference between, say, asserting that a predicate holds for some natural number or for some real number
In mathematics, a real number is a number that can be used to measure a ''continuous'' one-dimensional quantity such as a distance, duration or temperature. Here, ''continuous'' means that values can have arbitrarily small variations. Every ...

. Expository conventions often reserve some variable names such as "''n''" for natural numbers, and "''x''" for real numbers, although relying exclusively on naming conventions cannot work in general, since ranges of variables can change in the course of a mathematical argument.
A universally quantified formula over an empty range (like $\backslash forall\; x\backslash !\backslash in\backslash !\backslash varnothing\backslash ;\; x\; \backslash neq\; x$) is always vacuously true
In mathematics and logic, a vacuous truth is a conditional or universal statement (a universal statement that can be converted to a conditional statement) that is true because the antecedent cannot be satisfied. For example, the statement "sh ...

. Conversely, an existentially quantified formula over an empty range (like $\backslash exists\; x\backslash !\backslash in\backslash !\backslash varnothing\backslash ;\; x\; =\; x$) is always false.
A more natural way to restrict the domain of discourse uses ''guarded quantification''. For example, the guarded quantification
:For some natural number ''n'', ''n'' is even and ''n'' is prime
means
:For some even number
In mathematics, parity is the property of an integer of whether it is even or odd. An integer is even if it is a multiple of two, and odd if it is not.. For example, −4, 0, 82 are even because
\begin
-2 \cdot 2 &= -4 \\
0 \cdot 2 &= 0 \\
41 ...

''n'', ''n'' is prime.
In some mathematical theories, a single domain of discourse fixed in advance is assumed. For example, in Zermelo–Fraenkel set theory
In set theory, Zermelo–Fraenkel set theory, named after mathematicians Ernst Zermelo and Abraham Fraenkel, is an axiomatic system that was proposed in the early twentieth century in order to formulate a theory of sets free of paradoxes such ...

, variables range over all sets. In this case, guarded quantifiers can be used to mimic a smaller range of quantification. Thus in the example above, to express
:For every natural number ''n'', ''n''·2 = ''n'' + ''n''
in Zermelo–Fraenkel set theory, one would write
:For every ''n'', if ''n'' belongs to N, then ''n''·2 = ''n'' + ''n'',
where N is the set of all natural numbers.
Formal semantics

Mathematical semantics is the application ofmathematics
Mathematics is an area of knowledge that includes the topics of numbers, formulas and related structures, shapes and the spaces in which they are contained, and quantities and their changes. These topics are represented in modern mathematics ...

to study the meaning of expressions in a formal language. It has three elements: a mathematical specification of a class of objects via syntax
In linguistics, syntax () is the study of how words and morphemes combine to form larger units such as phrases and sentences. Central concerns of syntax include word order, grammatical relations, hierarchical sentence structure (constituency), ...

, a mathematical specification of various semantic domains and the relation between the two, which is usually expressed as a function from syntactic objects to semantic ones. This article only addresses the issue of how quantifier elements are interpreted.
The syntax of a formula can be given by a syntax tree. A quantifier has a scope, and an occurrence of a variable ''x'' is free if it is not within the scope of a quantification for that variable. Thus in
:$\backslash forall\; x\; (\backslash exists\; y\; B(x,y))\; \backslash vee\; C(y,x)$
the occurrence of both ''x'' and ''y'' in ''C''(''y'', ''x'') is free, while the occurrence of ''x'' and ''y'' in ''B''(''y'', ''x'') is bound (i.e. non-free).
An interpretation for first-order predicate calculus assumes as given a domain of individuals ''X''. A formula ''A'' whose free variables are ''x''closure operator In mathematics, a closure operator on a set ''S'' is a function \operatorname: \mathcal(S)\rightarrow \mathcal(S) from the power set of ''S'' to itself that satisfies the following conditions for all sets X,Y\subseteq S
:
Closure operators are de ...

on the set of formulas, by adding, for each free variable ''x'', a quantifier to bind ''x''. For example, the ''existential closure'' of the open formula ''n''>2 ∧ ''x''commutativity
In mathematics, a binary operation is commutative if changing the order of the operands does not change the result. It is a fundamental property of many binary operations, and many mathematical proofs depend on it. Most familiar as the name of ...

.
Paucal, multal and other degree quantifiers

None of the quantifiers previously discussed apply to a quantification such as :There are many integers ''n'' < 100, such that ''n'' is divisible by 2 or 3 or 5. One possible interpretation mechanism can be obtained as follows: Suppose that in addition to a semantic domain ''X'', we have given a probability measure P defined on ''X'' and cutoff numbers 0 < ''a'' ≤ ''b'' ≤ 1. If ''A'' is a formula with free variables ''x''Other quantifiers

A few other quantifiers have been proposed over time. In particular, the solution quantifier, noted § (section sign
The section sign, §, is a typographical character for referencing individually numbered sections of a document; it is frequently used when citing sections of a legal code. It is also known as the section symbol, section mark, double-s, or ...

) and read "those". For example,
:$\backslash left;\; href="/html/ALL/s/\backslash S\_n\_\backslash in\_\backslash mathbb\_\backslash quad\_n^2\_\backslash leq\_4\_\backslash right.html"\; ;"title="\backslash S\; n\; \backslash in\; \backslash mathbb\; \backslash quad\; n^2\; \backslash leq\; 4\; \backslash right">\backslash S\; n\; \backslash in\; \backslash mathbb\; \backslash quad\; n^2\; \backslash leq\; 4\; \backslash right$
is read "those ''n'' in N such that ''n''set-builder notation
In set theory and its applications to logic, mathematics, and computer science, set-builder notation is a mathematical notation for describing a set by enumerating its elements, or stating the properties that its members must satisfy.
Defining ...

as
:$\backslash \; =\; \backslash .$
Contrary to the other quantifiers, § yields a set rather than a formula.
Some other quantifiers sometimes used in mathematics include:
*There are infinitely many elements such that...
*For all but finitely many elements... (sometimes expressed as "for almost all elements...").
*There are uncountably many elements such that...
*For all but countably many elements...
*For all elements in a set of positive measure...
*For all elements except those in a set of measure zero...
History

Term logic
In philosophy, term logic, also known as traditional logic, syllogistic logic or Aristotelian logic, is a loose name for an approach to formal logic that began with Aristotle and was developed further in ancient history mostly by his followers, ...

, also called Aristotelian logic, treats quantification in a manner that is closer to natural language, and also less suited to formal analysis. Term logic treated ''All'', ''Some'' and ''No'' in the 4th century BC, in an account also touching on the alethic modalities.
In 1827, George Bentham
George Bentham (22 September 1800 – 10 September 1884) was an English botanist, described by the weed botanist Duane Isely as "the premier systematic botanist of the nineteenth century". Born into a distinguished family, he initially studie ...

published his ''Outline of a new system of logic, with a critical examination of Dr Whately's Elements of Logic'', describing the principle of the quantifier, but the book was not widely circulated.
William Hamilton claimed to have coined the terms "quantify" and "quantification", most likely in his Edinburgh lectures c. 1840. Augustus De Morgan confirmed this in 1847, but modern usage began with De Morgan in 1862 where he makes statements such as "We are to take in both ''all'' and ''some-not-all'' as quantifiers".
Gottlob Frege, in his 1879 ''Begriffsschrift
''Begriffsschrift'' (German for, roughly, "concept-script") is a book on logic by Gottlob Frege, published in 1879, and the formal system set out in that book.
''Begriffsschrift'' is usually translated as ''concept writing'' or ''concept notat ...

'', was the first to employ a quantifier to bind a variable ranging over a domain of discourse
In the formal sciences, the domain of discourse, also called the universe of discourse, universal set, or simply universe, is the set of entities over which certain variables of interest in some formal treatment may range.
Overview
The domain ...

and appearing in predicate
Predicate or predication may refer to:
* Predicate (grammar), in linguistics
* Predication (philosophy)
* several closely related uses in mathematics and formal logic:
** Predicate (mathematical logic)
**Propositional function
** Finitary relation ...

s. He would universally quantify a variable (or relation) by writing the variable over a dimple in an otherwise straight line appearing in his diagrammatic formulas. Frege did not devise an explicit notation for existential quantification, instead employing his equivalent of ~∀''x''~, or contraposition
In logic and mathematics, contraposition refers to the inference of going from a conditional statement into its logically equivalent contrapositive, and an associated proof method known as proof by contraposition. The contrapositive of a statem ...

. Frege's treatment of quantification went largely unremarked until Bertrand Russell
Bertrand Arthur William Russell, 3rd Earl Russell, (18 May 1872 – 2 February 1970) was a British mathematician, philosopher, logician, and public intellectual. He had a considerable influence on mathematics, logic, set theory, linguistics, ar ...

's 1903 ''Principles of Mathematics''.
In work that culminated in Peirce (1885), Charles Sanders Peirce
Charles Sanders Peirce ( ; September 10, 1839 – April 19, 1914) was an American philosopher, logician, mathematician and scientist who is sometimes known as "the father of pragmatism".
Educated as a chemist and employed as a scientist for ...

and his student Oscar Howard Mitchell independently invented universal and existential quantifiers, and bound variables. Peirce and Mitchell wrote Πfirst-order logic
First-order logic—also known as predicate logic, quantificational logic, and first-order predicate calculus—is a collection of formal systems used in mathematics, philosophy, linguistics, and computer science. First-order logic uses quantifie ...

, and 1931 paper on the incompleteness of Peano arithmetic.
Peirce's approach to quantification also influenced William Ernest Johnson and Giuseppe Peano, who invented yet another notation, namely (''x'') for the universal quantification of ''x'' and (in 1897) ∃''x'' for the existential quantification of ''x''. Hence for decades, the canonical notation in philosophy and mathematical logic was (''x'')''P'' to express "all individuals in the domain of discourse have the property ''P''," and "(∃''x'')''P''" for "there exists at least one individual in the domain of discourse having the property ''P''." Peano, who was much better known than Peirce, in effect diffused the latter's thinking throughout Europe. Peano's notation was adopted by the ''Principia Mathematica
The ''Principia Mathematica'' (often abbreviated ''PM'') is a three-volume work on the foundations of mathematics written by mathematician–philosophers Alfred North Whitehead and Bertrand Russell and published in 1910, 1912, and 1913. ...

'' of Whitehead and Russell, Quine, and Alonzo Church
Alonzo Church (June 14, 1903 – August 11, 1995) was an American mathematician, computer scientist, logician, philosopher, professor and editor who made major contributions to mathematical logic and the foundations of theoretical computer scienc ...

. In 1935, Gentzen introduced the ∀ symbol, by analogy with Peano's ∃ symbol. ∀ did not become canonical until the 1960s.
Around 1895, Peirce began developing his existential graph
An existential graph is a type of diagrammatic or visual notation for logical expressions, proposed by Charles Sanders Peirce, who wrote on graphical logic as early as 1882,Peirce, C. S., " n Junctures and Fractures in Logic (editors' title for ...

s, whose variables can be seen as tacitly quantified. Whether the shallowest instance of a variable is even or odd determines whether that variable's quantification is universal or existential. (Shallowness is the contrary of depth, which is determined by the nesting of negations.) Peirce's graphical logic has attracted some attention in recent years by those researching heterogeneous reasoning and diagrammatic inference.
See also

* Absolute generality * Almost all * Branching quantifier * Conditional quantifier * Counting quantification * Eventually (mathematics) * Generalized quantifier — a higher-order property used as standard semantics of quantifiednoun phrases
In linguistics, a noun phrase, or nominal (phrase), is a phrase that has a noun or pronoun as its head or performs the same grammatical function as a noun. Noun phrases are very common cross-linguistically, and they may be the most frequently oc ...

* Lindström quantifier — a generalized polyadic quantifier
*Quantifier elimination Quantifier elimination is a concept of simplification used in mathematical logic, model theory, and theoretical computer science. Informally, a quantified statement "\exists x such that \ldots" can be viewed as a question "When is there an x such t ...

* Quantifier shift
References

Bibliography

* Barwise, Jon; and Etchemendy, John, 2000. ''Language Proof and Logic''. CSLI (University of Chicago Press) and New York: Seven Bridges Press. A gentle introduction tofirst-order logic
First-order logic—also known as predicate logic, quantificational logic, and first-order predicate calculus—is a collection of formal systems used in mathematics, philosophy, linguistics, and computer science. First-order logic uses quantifie ...

by two first-rate logicians.
* Frege, Gottlob, 1879. ''Begriffsschrift
''Begriffsschrift'' (German for, roughly, "concept-script") is a book on logic by Gottlob Frege, published in 1879, and the formal system set out in that book.
''Begriffsschrift'' is usually translated as ''concept writing'' or ''concept notat ...

''. Translated in Jean van Heijenoort
Jean Louis Maxime van Heijenoort (; July 23, 1912 – March 29, 1986) was a historian of mathematical logic. He was also a personal secretary to Leon Trotsky from 1932 to 1939, and an American Trotskyist until 1947.
Life
Van Heijenoort was born ...

, 1967. ''From Frege to Gödel: A Source Book on Mathematical Logic, 1879-1931''. Harvard University Press. The first appearance of quantification.
* Hilbert, David; and Ackermann, Wilhelm, 1950 (1928). '' Principles of Mathematical Logic''. Chelsea. Translation of ''Grundzüge der theoretischen Logik''. Springer-Verlag. The 1928 first edition is the first time quantification was consciously employed in the now-standard manner, namely as binding variables ranging over some fixed domain of discourse. This is the defining aspect of first-order logic
First-order logic—also known as predicate logic, quantificational logic, and first-order predicate calculus—is a collection of formal systems used in mathematics, philosophy, linguistics, and computer science. First-order logic uses quantifie ...

.
* Peirce, C. S., 1885, "On the Algebra of Logic: A Contribution to the Philosophy of Notation, ''American Journal of Mathematics'', Vol. 7, pp. 180–202. Reprinted in Kloesel, N. ''et al.'', eds., 1993. ''Writings of C. S. Peirce, Vol. 5''. Indiana University Press. The first appearance of quantification in anything like its present form.
* Reichenbach, Hans, 1975 (1947). ''Elements of Symbolic Logic'', Dover Publications. The quantifiers are discussed in chapters §18 "Binding of variables" through §30 "Derivations from Synthetic Premises".
* Westerståhl, Dag, 2001, "Quantifiers," in Goble, Lou, ed., ''The Blackwell Guide to Philosophical Logic''. Blackwell.
* Wiese, Heike, 2003. ''Numbers, language, and the human mind''. Cambridge University Press. .
External links

* * . From College of Natural Sciences,University of Hawaii at Manoa
A university () is an institution of higher (or tertiary) education and research which awards academic degrees in several academic disciplines. Universities typically offer both undergraduate and postgraduate programs. In the United States, the ...

.
* Stanford Encyclopedia of Philosophy
The ''Stanford Encyclopedia of Philosophy'' (''SEP'') combines an online encyclopedia of philosophy with peer-reviewed publication of original papers in philosophy, freely accessible to Internet users. It is maintained by Stanford University. Eac ...

:
** Shapiro, Stewart (2000)"Classical Logic"

(Covers syntax, model theory, and metatheory for first order logic in the natural deduction style.) ** Westerståhl, Dag (2005)

"Generalized quantifiers"

* Peters, Stanley; Westerståhl, Dag (2002)

"Quantifiers"

{{Authority control Logic Predicate logic Quantifier (logic) Philosophical logic Semantics