Existential quantification

Uses your system voice; voice and rate in settings.

Snapshot

≈ 4 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

In predicate logic, an existential quantification is a type of quantifier which asserts the existence of an object with a given property. It is usually denoted by the logical operator symbol ∃, which, when used together with a predicate variable, is called an existential quantifier (" " or " " or " ), read as "there exists", "there is at least one", or "for some". Existential quantification is distinct from universal quantification ("for all"), which asserts that the property or relation holds for all members of the domain. Some sources use the term existentialization to refer to existential quantification. Quantification in general is covered in the article on quantification (logic). The existential quantifier is encoded as in Unicode, and as \exists in LaTeX and related formula editors.

In predicate logic, an existential quantification is a type of quantifier which asserts the existence of an object with a given property. It is usually denoted by the logical operator symbol ∃, which, when used together with a predicate variable, is called an existential quantifier (" " or " " or " ), read as "there exists", "there is at least one", or "for some". Existential quantification is distinct from universal quantification ("for all"), which asserts that the property or relation holds for all members of the domain. Some sources use the term existentialization to refer to existential quantification. Quantification in general is covered in the article on quantification (logic). The existential quantifier is encoded as in Unicode, and as \exists in LaTeX and related formula editors. For some natural number n , n\times n=25 . This is a single statement using existential quantification. It is roughly analogous to the informal sentence "Either 0\times 0=25 , or 1\times 1=25 , or 2\times 2=25 , or... and so on," but more precise, because it doesn't need us to infer the meaning of the phrase "and so on." (In particular, the sentence explicitly specifies its domain of discourse to be the natural numbers, not, for example, the real numbers.) This particular example is true, because 5 is a natural number, and when we substitute 5 for n, we produce the true statement 5\times 5=25 . It does not matter that " n\times n=25 " is true only for that single natural number, 5; the existence of a single solution is enough to prove this existential quantification to be true. In contrast, "For some even number n , n\times n=25 " is false, because there are no even solutions. The domain of discourse, which specifies the values the variable n is allowed to take, is therefore critical to a statement's trueness or falseness. Logical conjunctions are used to restrict the domain of discourse to fulfill a given predicate. For example, the sentence For some positive odd number n , n\times n=25 is logically equivalent to the sentence For some natural number n , n is odd and n\times n=25 . The mathematical proof of an existential statement about "some" object may be achieved either by a constructive proof, which exhibits an object satisfying the "some" statement, or by a nonconstructive proof, which shows that there must be such an object without concretely exhibiting one.

Notation

In symbolic logic, "∃" (a turned letter "E" in a sans-serif font, Unicode U+2203) is used to indicate existential quantification. For example, the notation \exists{n}{\in}\mathbb{N}: n\times n=25 represents the (true) statement There exists some n in the set of natural numbers such that n\times n=25 . The symbol's first usage is thought to be by Giuseppe Peano in Formulario mathematico (1896). Afterwards, Bertrand Russell popularised its use as the existential quantifier. Through his research in set theory, Peano also introduced the symbols \cap and \cup to respectively denote the intersection and union of sets.

Text derived from https://en.wikipedia.org/w/index.php?oldid=1347481322 under CC BY-SA 4.0; modifications have been made.

Provenance

snapshot enwiki-001347481322 · captured 1775513634.0 · version history

Cite this page as: encyclopegia.org, “Existential quantification”, snapshot enwiki-001347481322. https://encyclopegia.org/a/existential-quantification

Sources cited in this revision

4 named source(s) extracted from the cited revision. A source with no author is shown by its publication; nothing is invented.