Skip to main content

Abstract

Let A be the ring of polynomials in n indeterminates over ℝ. Then any subset S of ℝn which is the solution set of a polynomial system ƒ1(x) > 0, …, ƒ k (x) > 0 is also the solution set of a system of n inequalities g1(x) > 0, … g n (x) > 0, no matter how big k is. This observation, made about twelve years ago for n ≤ 3 and proved in full generality five years later is the starting point of the present book.

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 69.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 89.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

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Andradas, C., Bröcker, L., Ruiz, J.M. (1996). Introduction. In: Constructible Sets in Real Geometry. Ergebnisse der Mathematik und ihrer Grenzgebiete 3. Folge A Series of Modern Surveys in Mathematics, vol 33. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-80024-5_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-80024-5_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-80026-9

  • Online ISBN: 978-3-642-80024-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics