Skip to main content

Quantifier elimination in real closed fields

  • Chapter
Polynomial Algorithms in Computer Algebra

Part of the book series: Texts and Monographs in Symbolic Computation ((TEXTSMONOGR))

  • 285 Accesses

Abstract

Many interesting problems of the geometry over the real numbers can be stated as systems of polynomial equations, inequations, and inequalities, usually with some structure of quantification. For instance, in Sect. 1.1 the piano movers problem in robotics has been mentioned. There are many other application areas, e.g., stability conditions for difference schemes. Quantifier elimination provides an approach to solving such polynomial problems over the real numbers.

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

Access this chapter

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

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Wien

About this chapter

Cite this chapter

Winkler, F. (1996). Quantifier elimination in real closed fields. In: Polynomial Algorithms in Computer Algebra. Texts and Monographs in Symbolic Computation. Springer, Vienna. https://doi.org/10.1007/978-3-7091-6571-3_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-7091-6571-3_9

  • Publisher Name: Springer, Vienna

  • Print ISBN: 978-3-211-82759-8

  • Online ISBN: 978-3-7091-6571-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics