@inbook{Engeler1993,
    Abstract = {The axiomatization presented in the previous section is an attempt to axiomatize the set of theorems true in the intended structure. How well does it do this? The best for which one can hope in an axiomatization is that it can serve as the basis for an effective decision procedure, i.e. a procedure which, given any sentence S of the language, decides in finitely many steps whether or not S is true in the intended structure. The most informative decision procedures are those which proceed by quantifier elimination. This method is also the oldest. It was applied in the twenties by Langford to the theory of dense orderings, by Presburger to the (additive) theory of the integers, and finally by Tarski to the theory that we are considering. The paper by Yu. Ershov, mentioned in the references, surveys numerous subsequent applications of the method.},
    Address = {Berlin, Heidelberg},
    Author = {Engeler, Erwin},
    BookTitle = {Foundations of Mathematics: Questions of Analysis, Geometry {\&} Algorithmics},
    ISBN = {978-3-642-78052-3},
    Pages = {14--28},
    Publisher = {Springer Berlin Heidelberg},
    Title = {Elementary Theory of Real Numbers},
    URL = {https://doi.org/10.1007/978-3-642-78052-3\_3},
    Year = {1993},
    bdsk-url-1 = {https://doi.org/10.1007/978-3-642-78052-3\_3},
    date-added = {2020-03-25 13:19:43 +0100},
    date-modified = {2020-03-25 13:19:43 +0100},
    doi = {10.1007/978-3-642-78052-3_3}
}

@inbook{Engeler1993, Abstract = {The axiomatization presented in the previous section is an attempt to axiomatize the set of theorems true in the intended structure. How well does it do this? The best for which one can hope in an axiomatization is that it can serve as the basis for an effective decision procedure, i.e. a procedure which, given any sentence S of the language, decides in finitely many steps whether or not S is true in the intended structure. The most informative decision procedures are those which proceed by quantifier elimination. This method is also the oldest. It was applied in the twenties by Langford to the theory of dense orderings, by Presburger to the (additive) theory of the integers, and finally by Tarski to the theory that we are considering. The paper by Yu. Ershov, mentioned in the references, surveys numerous subsequent applications of the method.}, Address = {Berlin, Heidelberg}, Author = {Engeler, Erwin}, BookTitle = {Foundations of Mathematics: Questions of Analysis, Geometry {\&} Algorithmics}, ISBN = {978-3-642-78052-3}, Pages = {14--28}, Publisher = {Springer Berlin Heidelberg}, Title = {Elementary Theory of Real Numbers}, URL = {https://doi.org/10.1007/978-3-642-78052-3_3}, Year = {1993}, bdsk-url-1 = {https://doi.org/10.1007/978-3-642-78052-3_3}, date-added = {2020-03-25 13:19:43 +0100}, date-modified = {2020-03-25 13:19:43 +0100}, doi = {10.1007/978-3-642-78052-3_3} }