In predicate logic, an existential quantification is the predication^[1] of a property or relation to at least one member of the domain. It is denoted by the logical operator symbol ∃ (pronounced "there exists" or "for some"), which is called the existential quantifier. Existential quantification is distinct from universal quantification ("for all"), which asserts that the property or relation holds for any members of the domain.

Symbols are encoded U+2203 ∃ there exists (HTML: ∃ ∃ as a mathematical symbol) and U+2204 ∄ there does not exist (HTML: ∄).

Basics[link]

Consider a formula that states that some natural number multiplied by itself is 25.

0·0 = 25, or 1·1 = 25, or 2·2 = 25, or 3·3 = 25, and so on.

This would seem to be a logical disjunction because of the repeated use of "or". However, the "and so on" makes this impossible to integrate and to interpret as a disjunction in formal logic. Instead, the statement could be rephrased more formally as

For some natural number n, n·n = 25.

This is a single statement using existential quantification.

This statement is more precise than the original one, as the phrase "and so on" does not necessarily include all natural numbers, and nothing more. Since the domain was not stated explicitly, the phrase could not be interpreted formally. In the quantified statement, on the other hand, the natural numbers are mentioned explicitly.

This particular example is true, because 5 is a natural number, and when we substitute 5 for n, we produce "5·5 = 25", which is true. It does not matter that "n·n = 25" is only true for a single natural number, 5; even the existence of a single solution is enough to prove the existential quantification true. In contrast, "For some even number n, n·n = 25" is false, because there are no even solutions.

The domain of discourse, which specifies which values the variable n is allowed to take, is therefore of critical importance in a statement's trueness or falseness. Logical conjunctions are used to restrict the domain of discourse to fulfill a given predicate. For example:

For some positive odd number n, n·n = 25

is logically equivalent to

For some natural number n, n is odd and n·n = 25.

Here, "and" is the logical conjunction.

In symbolic logic, "∃" (a backwards letter "E" in a sans-serif font) is used to indicate existential quantification.^[2] Thus, if P(a, b, c) is the predicate "a·b = c" and Failed to parse (Missing texvc executable; please see math/README to configure.): \mathbb{N}

is the set of natural numbers, then

Failed to parse (Missing texvc executable; please see math/README to configure.): \exists{n}{\in}\mathbb{N}\, P(n,n,25)

is the (true) statement

For some natural number n, n·n = 25.

Similarly, if Q(n) is the predicate "n is even", then

Failed to parse (Missing texvc executable; please see math/README to configure.): \exists{n}{\in}\mathbb{N}\, \big(Q(n)\;\!\;\! {\wedge}\;\!\;\! P(n,n,25)\big)

is the (false) statement

For some natural number n, n is even and n·n = 25.

In mathematics, the proof of a "some" statement 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 but without exhibiting one.

Properties[link]

Negation[link]

A quantified propositional function is a statement; thus, like statements, quantified functions can be negated. The Failed to parse (Missing texvc executable; please see math/README to configure.): \lnot\   symbol is used to denote negation.

For example, if P(x) is the propositional function "x is between 0 and 1", then, for a domain of discourse X of all natural numbers, the existential quantification "There exists a natural number x which is between 0 and 1" is symbolically stated:

Failed to parse (Missing texvc executable; please see math/README to configure.): \exists{x}{\in}\mathbf{X}\, P(x)

This can be demonstrated to be irrevocably false. Truthfully, it must be said, "It is not the case that there is a natural number x that is between 0 and 1", or, symbolically:

Failed to parse (Missing texvc executable; please see math/README to configure.): \lnot\ \exists{x}{\in}\mathbf{X}\, P(x)

.

If there is no element of the domain of discourse for which the statement is true, then it must be false for all of those elements. That is, the negation of

Failed to parse (Missing texvc executable; please see math/README to configure.): \exists{x}{\in}\mathbf{X}\, P(x)

is logically equivalent to "For any natural number x, x is not between 0 and 1", or:

Failed to parse (Missing texvc executable; please see math/README to configure.): \forall{x}{\in}\mathbf{X}\, \lnot P(x)

Generally, then, the negation of a propositional function's existential quantification is a universal quantification of that propositional function's negation; symbolically,

Failed to parse (Missing texvc executable; please see math/README to configure.): \lnot\ \exists{x}{\in}\mathbf{X}\, P(x) \equiv\ \forall{x}{\in}\mathbf{X}\, \lnot P(x)

A common error is stating "all persons are not married" (i.e. "there exists no person who is married") when "not all persons are married" (i.e. "there exists a person who is not married") is intended:

Failed to parse (Missing texvc executable; please see math/README to configure.): \lnot\ \exists{x}{\in}\mathbf{X}\, P(x) \equiv\ \forall{x}{\in}\mathbf{X}\, \lnot P(x) \not\equiv\ \lnot\ \forall{x}{\in}\mathbf{X}\, P(x) \equiv\ \exists{x}{\in}\mathbf{X}\, \lnot P(x)

Negation is also expressible through a statement of "for no", as opposed to "for some":

Failed to parse (Missing texvc executable; please see math/README to configure.): \nexists{x}{\in}\mathbf{X}\, P(x) \equiv \lnot\ \exists{x}{\in}\mathbf{X}\, P(x)

Unlike the universal quantifier, the existential quantifier distributes over logical disjunctions:

Failed to parse (Missing texvc executable; please see math/README to configure.): \exists{x}{\in}\mathbf{X}\, P(x) \or Q(x) \to\ (\exists{x}{\in}\mathbf{X}\, P(x) \or \exists{x}{\in}\mathbf{X}\, Q(x))

Rules of Inference[link]

A rule of inference is a rule justifying a logical step from hypothesis to conclusion. There are several rules of inference which utilize the existential quantifier.

Existential introduction (∃I) concludes that, if the propositional function is known to be true for a particular element of the domain of discourse, then it must be true that there exists an element for which the proposition function is true. Symbolically,

Failed to parse (Missing texvc executable; please see math/README to configure.): P(a) \to\ \exists{x}{\in}\mathbf{X}\, P(x)

The reasoning behind existential elimination (∃E) is as follows: If it is given that there exists an element for which the proposition function is true, and if a conclusion can be reached by giving that element an arbitrary name, that conclusion is necessarily true, as long as it does not contain the name. Symbolically, for an arbitrary c and for a proposition Q in which c does not appear:

Failed to parse (Missing texvc executable; please see math/README to configure.): \exists{x}{\in}\mathbf{X}\, P(x) \to\ ((P(c) \to\ Q) \to\ Q)

Failed to parse (Missing texvc executable; please see math/README to configure.): P(c) \to\ Q

must be true for all values of c over the same domain X; else, the logic does not follow: If c is not arbitrary, and is instead a specific element of the domain of discourse, then stating P(c)  might unjustifiably give more information about that object.

The empty set[link]

The formula Failed to parse (Missing texvc executable; please see math/README to configure.): \exists {x}{\in}\emptyset \, P(x)

is always false, regardless of P(x). This is because Failed to parse (Missing texvc executable; please see math/README to configure.): \emptyset
denotes the empty set, and no x of any description – let alone an x fulfilling a given predicate P(x) – exist in the empty set. See also vacuous truth.

See also[link]

• Uniqueness quantification
• Quantifiers
• First-order logic

Notes[link]

1. ^ The term "predication" in grammar means the predicate of a sentence which refers to subject and is an adverb or adjective, or equivalent, that describes an attribute of the subject. In logic, "predication" is a declaration (or assertion) that is claimed to be self-evident and can be assumed as the basis for argument.
2. ^ This symbol is also known as the existential operator. It is sometimes represented with V.

References[link]

• Hinman, P. (2005). Fundamentals of Mathematical Logic. A K Peters. ISBN 1-56881-262-0. 

1. REDIRECTEric Church

This article has multiple issues. Please help improve it or discuss these issues on the talk page. This biography of a living person needs additional citations for verification. Tagged since January 2010. It needs to be updated. Tagged since January 2010.

Candy Crowley
Crowley in Houston, Texas, February 19, 2008
Born	Candy Alt Crowley (1948-12-26) December 26, 1948 (age 63) Michigan
Education	Randolph-Macon Woman's College
Occupation	Broadcast journalist
Notable credit(s)	Inside Politics Anchor of State of the Union
Title	Chief Political Correspondent and Anchor
Website
http://www.cnn.com/CNN/anchors_reporters/crowley.candy.html CNN Bio

Candy Alt Crowley (born 1948) is an American news anchor currently employed as CNN's Chief Political Correspondent, specializing in U.S. presidential, gubernatorial, and Senate elections. She is based in CNN's Washington bureau. She has covered elections for over two decades.

Biography[link]

Early life[link]

Candy Alt Crowley was born in Michigan on 26 December 1948. She attended Principia College in Elsah, Illinois for 2 years, before transferring to Randolph-Macon Woman's College in Lynchburg, Virginia where she graduated with a Bachelor of Arts degree in English.

Career[link]

Crowley started her career as a newsroom assistant with the Washington, D.C.-based radio station WASH-FM. She moved from NBC to CNN in 1987. She hosted Inside Politics in place of Judy Woodruff before the show was replaced with The Situation Room. On 31 January 2010 it was announced that Crowley would replace John King as the anchor of the Sunday-morning political talk show State of the Union, which she began hosting in February.^[1] She was featured twice in 2009 on the tenth anniversary edition of the popular game show Who Wants to be a Millionaire? as the expert for the "Ask the Expert" lifeline.

Personal life[link]

Crowley is known to be off-camera friends with CNN anchor Anderson Cooper.^{[citation needed]}

References[link]

External links[link]

• CNN bio
• Candy Crowley on Twitter
• Citizen Jane Politics interview
• Media Bistro interview

This biographical article related to television journalism in the United States is a stub. You can help Wikipedia by expanding it. v t e