Quantifier Elimination - History

History

In early model theory, quantifier elimination was used to demonstrate that various theories possess certain model-theoretic 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 is used to show that Presburger arithmetic, i.e. the theory of the additive natural numbers, 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 in a countable language is decidable, it is possible to extend its language with countably many relations to ensure that it admits quantifier elimination (for example, one can introduce a relation symbol for each formula).

Example: Nullstellensatz in ACF and DCF.

Read more about this topic:  Quantifier Elimination

Famous quotes containing the word history:

    When the coherence of the parts of a stone, or even that composition of parts which renders it extended; when these familiar objects, I say, are so inexplicable, and contain circumstances so repugnant and contradictory; with what assurance can we decide concerning the origin of worlds, or trace their history from eternity to eternity?
    David Hume (1711–1776)

    I am not a literary man.... I am a man of science, and I am interested in that branch of Anthropology which deals with the history of human speech.
    —J.A.H. (James Augustus Henry)

    Every library should try to be complete on something, if it were only the history of pinheads.
    Oliver Wendell Holmes, Sr. (1809–1894)