Skip to main content

Elementary constructive theory of ordered fields

  • Chapter
Effective Methods in Algebraic Geometry

Part of the book series: Progress in Mathematics ((PM,volume 94))

Abstract

The classical theory of ordered fields (Artin-Schreier theory) makes intensive use of non-constructive methods, in particular of the axiom of choice. However since Tarski (and even since Sturm and Sylvester) one knows how to compute in the real closure of an ordered field K solely by computations in K. This apparent contradiction is solved in this paper.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Bochnak, M. Coste, M.-F. Roy, “Geometrie algébrique réelle,” Springer Verlag, 1987.

    Google Scholar 

  2. M. Ben-Or, D. Kozen, J. Reif, The complexity of elementary algebra and geometry, J. of Computation and Systems Sciences 32 (1986), 251–264.

    Article  MATH  Google Scholar 

  3. S. Boughattas, “L’arithmétique ouverte et ses modèles non-standards,” Thèse, Université Paris VI, 1987.

    Google Scholar 

  4. M. Coste, M.-F. Roy, Thorn’s lemma, the coding of real algebraic numbers and the computation of the topology of semi-algebraic sets, J. Symbolic Computation 5 (1988), 121–129.

    Article  MathSciNet  MATH  Google Scholar 

  5. L. Gonzalez, H. Lombardi, T. Recio, M.-F. Roy, Spécialisation de la suite de Sturm et sous-résultants, To appear in RAIRO Informatique théorique. Detailed version, in CALSYF Journées du GRECO de Calcul Formel 1989.

    Google Scholar 

  6. A. Hollkott, “Finite Konstruktion geordneter algebraischer Erweiterungen von geordneten Grundkörpen,” Dissertation. Hamburg, 1941.

    Google Scholar 

  7. S. C. Kleene, “Introduction to Metamathematics.,” Van Nostrand, 1952.

    Google Scholar 

  8. J. Legras, “Méthodes numériques,” Dunod, 1963.

    Google Scholar 

  9. G. Metakides, A. Nerode, Effective content of field theory, Annals of Math. Logic 17 (1979), 289–320.

    Article  MathSciNet  MATH  Google Scholar 

  10. R. Mines, F. Richman, W. Ruitenburg, “A Course in Constructive Algebra,” Universitext, Springer-Verlag, 1988.

    Google Scholar 

  11. T. Sander, Existence and uniqueness of the real closure of an ordered field, Journal of Pure and Applied Algebra (to appear).

    Google Scholar 

  12. A. Seidenberg, Constructions in algebra, Transactions of AMS 197 (1974), 273–313.

    Article  MathSciNet  MATH  Google Scholar 

  13. H. Zassenhauss, A real root calculus, in “Computational aspects in abstract algebra,” Proceedings of a Conference held at Oxford, Pergamon Press, 1967, pp. 383–392.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer Science+Business Media New York

About this chapter

Cite this chapter

Lombardi, H., Roy, MF. (1991). Elementary constructive theory of ordered fields. In: Mora, T., Traverso, C. (eds) Effective Methods in Algebraic Geometry. Progress in Mathematics, vol 94. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4612-0441-1_17

Download citation

  • DOI: https://doi.org/10.1007/978-1-4612-0441-1_17

  • Publisher Name: Birkhäuser, Boston, MA

  • Print ISBN: 978-1-4612-6761-4

  • Online ISBN: 978-1-4612-0441-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics