Quantifier elimination

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.

Quantifier elimination is a concept of simplification used in mathematical logic, model theory, and theoretical computer science. Informally, a quantified statement " \exists x such that ..." can be viewed as a question "When is there an x such that ...?", and the statement without quantifiers can be viewed as the answer to that question. One way of classifying formulas is by the amount of quantification. Formulas with less depth of quantifier alternation are thought of as being simpler, with the quantifier-free formulas as the simplest. A theory has quantifier elimination if for every formula \alpha , there exists another formula \alpha_{QF} without quantifiers that is equivalent to it (modulo this theory).

Quantifier elimination is a concept of simplification used in mathematical logic, model theory, and theoretical computer science. Informally, a quantified statement " \exists x such that ..." can be viewed as a question "When is there an x such that ...?", and the statement without quantifiers can be viewed as the answer to that question. One way of classifying formulas is by the amount of quantification. Formulas with less depth of quantifier alternation are thought of as being simpler, with the quantifier-free formulas as the simplest.

A theory has quantifier elimination if for every formula \alpha , there exists another formula \alpha_{QF} without quantifiers that is equivalent to it (modulo this theory). \begin{align}&\exists x\in\mathbb{R}\; (a\neq 0 \wedge ax^2+bx+c=0)\\ &a\neq 0 \wedge b^2-4ac\geq 0 \end{align} Here the first sentence involves a quantifier \exists x\in\mathbb{R} , while the equivalent second sentence does not.

Examples of theories that have been shown decidable using quantifier elimination are Presburger arithmetic, Skolem arithmetic, algebraically closed fields, real closed fields, atomless Boolean algebras, term algebras, dense linear orders, abelian groups, Rado graphs, as well as many of their combinations such as Boolean algebra with Presburger arithmetic, and term algebras with queues.

Quantifier elimination for the theory of the real numbers as an ordered additive group is Fourier–Motzkin elimination; for the theory of the field of real numbers it is the Tarski–Seidenberg theorem. Quantifier elimination can also be used to show that "combining" decidable theories leads to new decidable theories (see Feferman–Vaught theorem). \exists x. \bigwedge_{i=1}^n L_i where each L_i is a literal, is equivalent to a quantifier-free formula.

Indeed, suppose we know how to eliminate quantifiers from conjunctions of literals, then if F is a quantifier-free formula, we can write it in disjunctive normal form \bigvee_{j=1}^m \bigwedge_{i=1}^n L_{ij}, and use the fact that \exists x. \bigvee_{j=1}^m \bigwedge_{i=1}^n L_{ij} is equivalent to \bigvee_{j=1}^m \exists x. \bigwedge_{i=1}^n L_{ij}. Finally, to eliminate a universal quantifier \forall x. F where F is quantifier-free, we transform \lnot F into disjunctive normal form, and use the fact that \forall x.

F is equivalent to \lnot \exists x. \lnot F.

Relationship with decidability

In early model theory, quantifier elimination was used to demonstrate that various theories possess properties like decidability and completeness. A common technique was to show first that a theory admits elimination of quantifiers and thereafter prove decidability or completeness by considering only the quantifier-free formulas. This technique can be used to show that Presburger arithmetic is decidable. Theories could be decidable yet not admit quantifier elimination.

Strictly speaking, the theory of the additive natural numbers did not admit quantifier elimination, but it was an expansion of the additive natural numbers that was shown to be decidable. Whenever a theory is decidable, and the language of its valid formulas is countable, it is possible to extend the theory with countably many relations to have quantifier elimination (for example, one can introduce, for each formula of the theory, a relation symbol that relates the free variables of the formula).

Example: Nullstellensatz for algebraically closed fields and for differentially closed fields.

Notes

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

Sources cited in this revision

No external citation was extracted for this revision. That is a statement about the source, not a claim that none exists.