Skip to main content
Springer Nature Link
Log in

A procedure to prove geometrical statements

  • Conference paper
  • First Online:
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (AAECC 1987)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 356))

  • 166 Accesses

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bayer D.A. The division algorithm and the Hilbert scheme. Ph.D. Thesis Harvard 1982.

    Google Scholar 

  2. Ben-Or M., Kozen D., Reif J. The complexity of Elementary Algebra and Geometry, J. of Computation and System Sciences 32 109–138 1986.

    Google Scholar 

  3. Buchberger B. Gröbner bases — An algorithmic method in polynomial ideal theory. ch 6 in N.B.Bose (ed.) "Multidimensional system theory" D.Reidel Publ.Comp.

    Google Scholar 

  4. Carra` Ferro G. Some properties of the lattice points and their application to differential algebra. To appear in Communications in Algebra.

    Google Scholar 

  5. Castro F. Thèse de 3o cycle, Paris VII, Oct 1984.

    Google Scholar 

  6. Chou S.C. Proving Elementary Geometry Theorems Using Wu's algorithm. AMS Contemporary Math.,29,p.243–286 1984.

    Google Scholar 

  7. Chou S.C. Proving Geometry theorems using Wu's method. Technical Report of Istitute for Computing Science.University of Texas at Austin, July 1986.

    Google Scholar 

  8. Chou S.C.,Schelter W.F. Proving Geometry theorems with Rewrite Rules. Preprint Dec. 1985.

    Google Scholar 

  9. Galligo A., A propos du théorème de préparation de Weierstrass, Thèse du 3o cycle, Lecture Notes in Mathematics, n.409(1973), 543–579 Springer Verlag1973.

    Google Scholar 

  10. Galligo A. Some algorithmic questions on ideals of differential operators, Eurocal 85, Lecture Notes in Computer Science, n.204, 413–421 Springer Verlag 1986.

    Google Scholar 

  11. Garey M.R.,Johnson D.S.Computers and intractability. Freeman & Co., S.Francisco 1979.

    Google Scholar 

  12. Giusti M. Some effectivity problems in polynomial ideal theory, Eurosam 84, Lecture Notes in Computer Science, n.174, 159–171 Springer Verlag 1985.

    Google Scholar 

  13. Giusti M. A note on the complexity of constructing standard bases, Eurocal 85, Lecture Notes in Computer Science, n.204, 411–412 Springer Verlag 1986.

    Google Scholar 

  14. Harthshorne R. Algebraic Gesmetry GMT S2 Springer Verlag.

    Google Scholar 

  15. Heintz J. Definability and fast quantifier elimination in algebraically closed field, Theoretical Computer Science 24, 239–277 1983.

    Article  Google Scholar 

  16. Kapur D.K. Using Gröbner bases to reason about Geometry problems. J of Sym. Computation 2, p.399–408, 1986.

    MathSciNet  Google Scholar 

  17. Kredel H.,Weisfenning V., Computing dimension and indipendent sets for polynomial ideals. Preprint 1986.

    Google Scholar 

  18. Kutzler B.,Stifter S. Automated Geometry Theorem proving using Buchberger's Algorithm. Proc.SYMSAC'86 Waterloo, Canada.

    Google Scholar 

  19. Kutzler B.,Stifter S. On the application of Buchberger's algorithm to automated geometry theorem proving. J. of Sym. Computation 2, p.389–397, 1986.

    MathSciNet  Google Scholar 

  20. Kutzler B.,Stifter S. Collection of computerized proofs of Geometry Theorem. Univ.Linz technical report 1986.

    Google Scholar 

  21. Möller A.M.,Mora F. The computation of the Hilbert function. Proc EUROCAL 83 Springer LNCS 162 157–167.

    Google Scholar 

  22. Ritt J.F. Differential Algebra. AMS 1950.

    Google Scholar 

  23. Wu Wen-Tsün, On the decision problem and the mechanization of theorem proving in elementary Geometry.Scientia Sinica, 21 (1978) 159–172.

    Google Scholar 

  24. Wu Wen-Tsün, Basic principles of mechanical theorem proving in elementary geometries. J.Sys.Sci.& Math.Scis.4(3) 1984, 207–235.

    Google Scholar 

  25. Wu Wen-Tsün, Some recent advances in mechanical theorem proving of Geometries. AMS Contemporary Math. 29,p.235–241.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Matematica, Universita' di Catania, Viale A. Doria 6, 95125, Catania, Italy

    Giuseppa Carra' Ferro & Giovanni Gallo

  2. Courant Institute, New York University, 251 Mercer Street, 10012, N.Y.C., N.Y., U.S.A.

    Giuseppa Carra' Ferro & Giovanni Gallo

Authors
  1. Giuseppa Carra' Ferro
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Giovanni Gallo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Llorenç Huguet Alain Poli

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ferro, G.C., Gallo, G. (1989). A procedure to prove geometrical statements. In: Huguet, L., Poli, A. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 1987. Lecture Notes in Computer Science, vol 356. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51082-6_74

Download citation

  • DOI: https://doi.org/10.1007/3-540-51082-6_74

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51082-6

  • Online ISBN: 978-3-540-46150-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics