Existential Quantifier (∃)

Mathematical Logic · Axiom Academy

LESSON Existential Quantifier (∃) Understanding "there exists" statements in predicate logic The existential quantifier is written as ∃, which is read as "there exists." When we write ∃x P(x), we mean: 2. How to Read and Truth Conditions The statement ∃x P(x) is true when P(x) is true for at least one value of x in the domain. It doesn't matter if it's true for many values or just one—we only need one to make the existential statement true. 3. Finite Domains and Disjunction When working with finite domains, the existential quantifier can be expressed as a logical disjunction (OR). If our domain has n elements a₁, a₂, ..., aₙ , then: 4. Examples with Different Domains The truth value of an existential statement depends crucially on the domain. The same predicate can be true in one domain and false in another. The existential quantifier corresponds to several natural language expressions. Recognizing these helps translate between English and logical notation.

This is the written version of the interactive lesson above. See the full Mathematical Logic course.