IX. Ein Entscheidungsverfahren für die Theorie der reell-abgeschlossenen Körper

  • H. R. Wüthrich
Part of the Lecture Notes in Computer Science book series (LNCS, volume 43)


  1. Bareiss, E.H., Sylvester's Identity and Multistep Integer Preserving Gaussian Elimination, Math. Comp. 22 (1968) 565–566.Google Scholar
  2. Collins, G.E., Quantifier elimination for real closed fields by cylindrical algebraic decomposition, Lecture Notes in Computer Science No. 33, pp. 134–183, Springer, 1975.Google Scholar
  3. Heindel, L.E., Integer Arithmetic Algorithms for Polynomial Real Zero Determination, J. ACM 18 (1971) 533–548.Google Scholar
  4. Monck, L., An Elementary-Recursive Decision Procedure for Th(IR, +, ·), Univ. of Calif., Berkeley, Dept. of Math., preprint.Google Scholar
  5. Solovay, R., Brieflicher Hinweis 1975.Google Scholar
  6. Tarski, A., A Decision Method for Elementary Algebra and Geometry, University of California Press, Berkeley, 1951.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1976

Authors and Affiliations

  • H. R. Wüthrich

There are no affiliations available

Personalised recommendations