Skip to main content

On Lack of Effectiveness in Semi-algebraic Geometry

  • Chapter
Effective Methods in Algebraic Geometry

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

  • 702 Accesses


It is a fact and a motivation of this meeting, that many interesting constructions in semi-algebraic geometry can be effectively done, that is, roughly speaking, by means of algorithms with computably bounded complexity. It is also a fact that semi-algebraic objects have some effective finiteness properties. Hence the interest in finding reasonably ”fast” algorithms or “sharp” bounds. Neverthless, on the other side of the mainstream, one can be interested in essential lack of effectiveness or finiteness. We are going to see some examples and to discuss shortly some possible basic sources of such a lack.

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

Access this chapter

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


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others


  1. F. Acquistapace, R. Benedetti, F. Broglia, Effectiveness — non Effectiveness in semialgebraic and P. L. geometry, Inventiones Math. (to appear).

    Google Scholar 

  2. R. Benedetti, M. Shiota, Finiteness of semialgebraic types of polynomial functions, to appear.

    Google Scholar 

  3. T. Fukuda, type topologique des polynômes, Publ. Math. I.H.E.S. 46 (1976), 87–106.

    MathSciNet  MATH  Google Scholar 

  4. J. R. Munkres, “Elementary Differential Topology,” Am. math. Studies, n.61, Princeton Univ. Press, 1968.

    Google Scholar 

  5. I. Nakai, On topological types of polynomial mappings, Topology 23 (1984), 45–66.

    Article  MathSciNet  MATH  Google Scholar 

  6. A. Nabutovski, Isotopies and non-recursive functions in real algebraic geometry, in “Real analytic and algebraic geometry,” Springer Lect. Notes in Math. n. 1420, 1990.

    Google Scholar 

  7. M. Shiota, M. Yokoi, Triangulations of sub analytic sets and locally subanalytic manifolds, Trans. AMS 286 (1984), 727–750.

    Article  MathSciNet  MATH  Google Scholar 

  8. R. Thorn, La stabilité topologique des applications polynomiales, Einseign. Math. 8 (1962), 24–33.

    Google Scholar 

  9. I. A. Volodin, V. E. Kuztenov, A. T. Fomenko, The problem of discriminating algorithmically the standard 3-sphere, Russian Math. Surveys 29(5) (1974), 71–172.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations


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

Benedetti, R. (1991). On Lack of Effectiveness in Semi-algebraic Geometry. In: Mora, T., Traverso, C. (eds) Effective Methods in Algebraic Geometry. Progress in Mathematics, vol 94. Birkhäuser, Boston, MA.

Download citation

  • DOI:

  • 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