Quantifier (logic)

In natural languages, a quantifier turns a sentence about something having some property into a sentence about the number (quantity) of things having the property. Examples of quantifiers in English are "all", "some", "many", "few", "most", and "no";[1] examples of quantified sentences are "all people are mortal", "some people are mortal", and "no people are mortal", they are considered to be true, true, and false, respectively.

In mathematical logic, in particular in first-order logic, a quantifier achieves a similar task, operating on a mathematical formula rather than an English sentence.

More precisely, a quantifier specifies the quantity of specimens in the domain of discourse that satisfy an open formula. The two most common formal quantifiers are "for each" (traditionally symbolized by "∀"), and "there exists some" ("∃").[3] For example, in arithmetic, quantifiers allow one to say that the natural numbers go on forever, by writing that "for each natural number n, there exists some natural number m that is bigger than n"; this can be written formally as "∀n∈ℕ. ∃m∈ℕ. m>n".[4] The above English examples could be formalized as "∀p∈P. m(p)",[5] "∃p∈P. m(p)", and "¬ ∃p∈P. m(p)",[6] respectively, when P denotes the set of all people, and m(p) denotes "p is mortal".

A formula beginning with a quantifier is called a quantified formula. A formal quantifier requires a variable, which is said to be bound by it, and a subformula specifying a property of that variable.

Formal quantifiers have been generalized beginning with the work of Mostowski and Lindström.

## Contents

* 1 Relations to logical conjunction and disjunction
* 1.1 Infinite domain of discourse
* 2 Algebraic approaches to quantification
* 3 Notation
* 4 Order of quantifiers (nesting)
* 5 Equivalent expressions
* 6 Range of quantification
* 7 Formal semantics
* 8 Paucal, multal and other degree quantifiers
* 9 Other quantifiers
* 10 History
* 11 See also
* 12 References
* 13 External links

## Relations to logical conjunction and disjunction

For a finite domain of discourse D = {a1,...an} the universal quantifier is equivalent to a logical conjunction of propositions with singular terms ai having the form Pai for monadic predicates.

The existential quantifier is equivalent to a logical disjunction of propositions having the same structure as before. For infinite domains of discourse the equivalences are similar.

### Infinite domain of discourse

Consider the following statement:

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 of formal languages this is immediately a problem, since syntax 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, 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 n, n · 2 = n \+ n.

A similar analysis applies to the disjunction,

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 n, n is equal to 5+5.

## Algebraic approaches to quantification

It is possible to devise abstract algebras whose models include formal languages with quantification, but progress has been slow[clarification needed] 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, 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.

## 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) the predicate "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 ∀x∈X,P(x)∨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,

∃xP∀xP

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:

⋁xP(∃x)P(∃x . P)∃x ⋅ P(∃x:P)∃x(P)∃xP∃x,P∃x∈XP∃x:XP

All of these variations also apply to universal quantification. Other variations for the universal quantifier are

⋀xP(x)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,
* 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 computer programming 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. 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 = n2.

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 = n2.

This is clearly false; it asserts that there is a single natural number s that is at the same time 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 mathematical analysis 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 ∀ε>0∀x∈ℝ∃δ>0∀h∈ℝ(|h|<δ⇒|f(x)−f(x+h)|<ε)
* uniformly continuous if ∀ε>0∃δ>0∀x∈ℝ∀h∈ℝ(|h|<δ⇒|f(x)−f(x+h)|<ε)

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) = x2 satisfies pointwise, but not uniform continuity. In contrast, interchanging the two initial universal quantifiers in the definition of pointwise continuity does not change the meaning.

The maximum depth of nesting of quantifiers in a formula is called its quantifier rank.

## 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

∀x∈DP(x).

This notation is known as restricted or relativized or bounded quantification. Equivalently one can write,

∀x(x∈D->P(x)).

The existential proposition can be expressed with bounded quantification as

∃x∈DP(x),

or equivalently

∃x(x∈D∧P(x)).

Together with negation, only one of either the universal or existential quantifier is needed to perform both tasks:

¬(∀x∈DP(x))≡∃x∈D¬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,

¬(∃x∈DP(x))≡∀x∈D¬P(x),

to disprove a "there exists an x" proposition, one needs to show that the predicate is false for all x.

## Range of quantification

Every quantification involves one specific variable and a domain of discourse 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, asserting that a predicate holds for some natural number or for some real number. 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 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 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, 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, it can be said

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 of 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, 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

∀x(∃yB(x,y))∨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).

Syntax tree of the formula ∀x(∃yB(x,y))∨C(y,x), illustrating scope and variable capture. Bound and free variable occurrences are colored in red and green, respectively.

An interpretation for first-order predicate calculus assumes as given a domain of individuals X. A formula A whose free variables are x1, ..., xn is interpreted as a boolean-valued function F(v1, ..., vn) 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

∀xnA(x1,…,xn)

is the function G of n-1 arguments such that G(v1, ..., vn-1) = T if and only if F(v1, ..., vn-1, w) = T for every w in X. If F(v1, ..., vn-1, w) = F for at least one value of w, then G(v1, ..., vn-1) = F. Similarly the interpretation of the formula

∃xnA(x1,…,xn)

is the function H of n-1 arguments such that H(v1, ..., vn-1) = T if and only if F(v1, ..., vn-1, w) = T for at least one w and H(v1, ..., vn-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

∃!xnA(x1,…,xn)

then is the function of n-1 arguments, which is the logical and of the interpretations of

∃xnA(x1,…,xn)
∀y,z{A(x1,…,xn−1,y)∧A(x1,…,xn−1,z)⟹y=z}.

Each kind of quantification defines a corresponding closure operator on the set of formulas, by adding, for each free variable x, a quantifier to bind x.[7] For example, the existential closure of the open formula n>2 ∧ xn+yn=zn is the closed formula ∃n ∃x ∃y ∃z (n>2 ∧ xn+yn=zn); 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 univeral closure, like ∀x ∀y (x+y=y+x) to express commutativity.

## 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 x1,...,xn whose interpretation is the function F of variables v1,...,vn then the interpretation of

∃manyxnA(x1,…,xn−1,xn)

is the function of v1,...,vn-1 which is T if and only if

P⁡{w:F(v1,…,vn−1,w)=𝐓}≥b

and F otherwise. Similarly, the interpretation of

∃fewxnA(x1,…,xn−1,xn)

is the function of v1,...,vn-1 which is F if and only if

0<P⁡{w:F(v1,…,vn−1,w)=𝐓}≤a

and T otherwise.

## Other quantifiers

A few other quantifiers have been proposed over time. In particular, the solution quantifier,[8]: 28 noted § (section sign) and read "those". For example,

[§n∈ℕn2≤4]={0,1,2}

is read "those n in N such that n2 ≤ 4 are in {0,1,2}." The same construct is expressible in set-builder notation as

{n∈ℕ:n2≤4}={0,1,2}.

Contrary to the other quantifiers, § yields a set rather than a formula.[9]

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, 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 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.[10]

Augustus De Morgan (1806-1871) was the first to use "quantifier" in the modern way.

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".[11]

Gottlob Frege, in his 1879 Begriffsschrift, was the first to employ a quantifier to bind a variable ranging over a domain of discourse and appearing in predicates. 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. Frege's treatment of quantification went largely unremarked until Bertrand Russell's 1903 Principles of Mathematics.

In work that culminated in Peirce (1885), Charles Sanders Peirce and his student Oscar Howard Mitchell independently invented universal and existential quantifiers, and bound variables. Peirce and Mitchell wrote Π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 first-order logic, 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 of Whitehead and Russell, Quine, and Alonzo Church. 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 graphs, 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

* Generalized quantifier -- a higher-order property used as standard semantics of quantified noun phrases
* Lindström quantifier -- a generalized polyadic quantifier
* Quantifier elimination
* Almost all
* Eventually (mathematics)

## References

1. ↑ See Quantifier (linguistics) for details.
2. ↑ For an exception, see e.g. Hans Hermes (1973). Introduction to Mathematical Logic. Hochschultext (Springer-Verlag). London: Springer. ISBN 3540058192. Here: Remark II.1.5
3. ↑ They correspond to the English quantifiers "all", and "some", respectively. Neither "many" nor "few" can be formalized, due to their vague meaning. "Most" is difficult to formalize when speaking about infinite sets. "No" can be expressed as the opposite of "some". The latter could be expressed, in turn, using "all", but this is rarely done.[2]
4. ↑ This formula can be proven true, since, given an arbitrary n, chosing m e.g. as the successor of n will do.
5. ↑ Literally: "For each member p of the set of all people, p is mortal."
6. ↑ Literally: "It is not true that there exists some member p of the set of all people such that p is mortal."
7. ↑ in general, for a quantifer Q, closure makes sense only if the order of Q quantification does not matter, i.e. if Qx Qy p(x,y) is equivalent to Qy Qx p(x,y). This is satisfied for Q ∈ {∀,∃}, cf. #Order of quantifiers (nesting) above.
8. ↑ Hehner, Eric C. R., 2004, Practical Theory of Programming, 2nd edition, p. 28
9. ↑ Hehner (2004) uses the term "quantifier" in a very general sense, also including e.g. summation.
10. ↑ George Bentham, Outline of a new system of logic: with a critical examination of Dr. Whately's Elements of Logic (1827); Thoemmes; Facsimile edition (1990) ISBN 1-85506-029-9
11. ↑ Peters, Stanley; Westerståhl, Dag (2006-04-27). Quantifiers in Language and Logic. Clarendon Press. pp. 34–. ISBN 978-0-19-929125-0. https://books.google.com/books?id=PrYUDAAAQBAJ&pg=PA34.

* Barwise, Jon; and Etchemendy, John, 2000. Language Proof and Logic. CSLI (University of Chicago Press) and New York: Seven Bridges Press. A gentle introduction to first-order logic by two first-rate logicians.
* Frege, Gottlob, 1879. Begriffsschrift. Translated in Jean van Heijenoort, 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.
* 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. ISBN 0-521-83182-2.

## External links

* Hazewinkel, Michiel, ed. (2001), "Quantifier", Encyclopedia of Mathematics, Springer Science+Business Media B.V. / Kluwer Academic Publishers, ISBN 978-1-55608-010-4, https://www.encyclopediaofmath.org/index.php?title=p/q076260
* ""For all" and "there exists" topical phrases, sentences and expressions". http://www.math.hawaii.edu/~ramsey/Logic/ForAll.html. . From College of Natural Sciences, University of Hawaii at Manoa.
* Stanford Encyclopedia of Philosophy:
* 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"

* v
* t
* e

Formal fallacies

* Masked man
* Mathematical fallacy

In propositional logic|

* Affirming a disjunct
* Affirming the consequent
* Denying the antecedent
* Argument from fallacy

In quantificational logic|

* Existential
* Illicit conversion
* Proof by example
* Quantifier shift

Syllogistic fallacy|

* Affirmative conclusion from a negative premise
* Exclusive premises
* Existential
* Necessity
* Four terms
* Illicit major
* Illicit minor
* Negative conclusion from affirmative premises
* Undistributed middle

* Other types of formal fallacy
* List of fallacies

* v
* t
* e

Mathematical logic

General|

* Formal language
* Formation rule
* Formal proof
* Formal semantics
* Well-formed formula
* Set
* Element
* Class
* Classical logic
* Axiom
* Rule of inference
* Relation
* Theorem
* Logical consequence
* Type theory
* Symbol
* Syntax
* Theory

Systems|

* Formal system
* Deductive system
* Axiomatic system
* Hilbert style systems
* Natural deduction
* Sequent calculus

Traditional logic|

* Proposition
* Inference
* Argument
* Validity
* Cogency
* Syllogism
* Square of opposition
* Venn diagram

Propositional calculus
and Boolean logic

* Boolean functions
* Propositional calculus
* Propositional formula
* Logical connectives
* Truth tables
* Many-valued logic

Predicate logic|

* First-order
* Quantifiers
* Predicate
* Second-order
* Monadic predicate calculus

Naive set theory|

* Set
* Empty set
* Element
* Enumeration
* Extensionality
* Finite set
* Infinite set
* Subset
* Power set
* Countable set
* Uncountable set
* Recursive set
* Domain
* Codomain
* Image
* Map
* Function
* Relation
* Ordered pair

Set theory|

* Foundations of mathematics
* Zermelo–Fraenkel set theory
* Axiom of choice
* General set theory
* Kripke–Platek set theory
* Von Neumann–Bernays–Gödel set theory
* Morse–Kelley set theory
* Tarski–Grothendieck set theory

Model theory|

* Model
* Interpretation
* Non-standard model
* Finite model theory
* Truth value
* Validity

Proof theory|

* Formal proof
* Deductive system
* Formal system
* Theorem
* Logical consequence
* Rule of inference
* Syntax

Computability
theory|

* Recursion
* Recursive set
* Recursively enumerable set
* Decision problem
* Church–Turing thesis
* Computable function
* Primitive recursive function

0.00

(0 votes)

Original source: https://en.wikipedia.org/wiki/Quantifier (logic). Read more

|

Retrieved from "https://handwiki.org/wiki/index.php?title=Philosophy:Quantifier_(logic)&oldid=1041920"
*[v]: View this template
*[t]: Discuss this template
*[e]: Edit this template