Existential quantification forms . In a first-order structure, it is true at an assignment to when some domain element makes the instance true. In natural deduction, elimination uses a fresh variable for the hypothetical witness; that variable may not escape into the conclusion or the remaining undischarged assumptions.
Existence requires at least one witness, not exactly one. Over the natural numbers , is true: works, as do . In intuitionistic first-order logic, a direct proof supplies a witness together with a proof of the corresponding instance; merely rejecting nonexistence is generally weaker.
Placing existential quantification before universal quantification requires a single witness that works throughout:
This first-order sentence is false. For any proposed , choose : the required inequality becomes . For example, works for but fails at . No finite list of successful checks establishes universal quantification over the natural numbers.
Assume with . For the forward implication, open a fresh existential witness, instantiate domain exhaustiveness at it, and split into the equality cases. The equality elimination rule transfers its predicate to the corresponding constant, which supplies the required disjunct. Closing the witness scope is legal because the result contains only the named constants. Conversely each named instance gives the existential by the existential quantifier introduction rule, and cases combine those derivations. The constants need not denote distinct objects. A negated named instance can eliminate one case through contradiction and logical falsity elimination rule.
An existential formula is an existential block followed by a quantifier-free formula, with remaining free variables serving as parameters. Truth is preserved by structure embeddings. Reflection of truth for every such formula defines an existential embedding.

Articles by others on the same topic (2)

Existential quantification is a concept from mathematical logic and predicate logic that expresses that there exists at least one element in a particular domain for which a certain property or predicate holds true. It is typically denoted using the symbol ∃ (the existential quantifier).