Editing Elimination theory (section)

==Connection to logic==
There is also a logical facet to elimination theory, as seen in the [[Boolean satisfiability problem]]. In the worst case, it is presumably hard to eliminate variables computationally. ''[[Quantifier elimination]]'' is a term used in [[mathematical logic]] to explain that, in some theories, every formula is equivalent to a formula without quantifier. This is the case of the theory of [[polynomial]]s over an [[algebraically closed field]], where elimination theory may be viewed as the theory of the methods to make quantifier elimination algorithmically effective. [[Tarski–Seidenberg theorem|Quantifier elimination over the reals]] is another example, which is fundamental in [[algebraic geometry#Computational algebraic geometry|computational algebraic geometry]].