This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Bayer D.A. The division algorithm and the Hilbert scheme. Ph.d. Thesis Harvard 1982.
Ben-Or M.,Kozen D.,Reif J. The complexity of Elementary Algebra and Geometry. J.of Computation and System Science 32 p.109–138 (1986).
Blum L. Differentially closed fields: a model theoretic tour. in Contribution to Algebra p.37–60 Academic Press 1977.
Buchberger B. A critical pair completion algorithm for finitely generated ideals in rings. Proc. logic and Machines: Decision problems and Complexity, Springer LNCS 171 p.137–161 (1983).
Buchberger B.,Loos J. Algebraic Simplification in Computer Algebra p.11–43 Springer 1982.
Carra' G. Some upper bounds for the multiplicity of an autoreduced subset of Nn and their applications. Proc.AAECC 3 Springer LNCS 299 p.306–315.
Carra' G., Gallo G. A procedure to prove geometrical statements. submitted to AAECC 5.
Enderton H.B. A Mathematical Introduction to Logic Academic Press (1973).
Giusti M. A note on complexity of constructing standard bases Proc.EUROCAL 85,II Springer LNCS p.411–412 1985.
Hermann G. Die Frage der endlich vielen Schritte in der Theorie der Polynomideale, Math.Ann. 95 (1926), p.736–788.
Heintz J. Definability and fast quantifier elimination in algebraically closed fields. Theoretical Computer Science 24(1983) p.239–277.
Heintz J. and Wutrich R. An efficient quantifier elimination algorithm for algebraically closed field of any characteristic. SIGSAM Bull. 9(4) (1975) 11.
Kolchin E. Differential Algebra and algebraic groups. Academic Press 1973.
Kapur D.K. Using Gröbner bases to reason about geometry problems. J.of Sym.Computation 2,p.399–408, 1986.
Knuth D.E. and Bendix P.B. Simple words problems in universal algebras. Proc.Conf.Comp.problems in abstract algebra,1967 p.263–297 Pergamon Press 1970.
Kutzler B. and Stifter S. On the application of Buchberger's algorithm to automated geometry theorem proving J. of Sym. Computation 2, p. 389–397, 1986.
Möller H.M., Mora F. Upper and lower bounds for the degree of Gröbner bases. Proc EUROSAM 84 Springer LNCS 174 p.172–183
Ritt J.F. Differential Algebra AMS 1950.
Seidenberg A. Constructions in Algebra Trans. AMS 197, p.273–313 (1974).
Wu W. Basic Principles of mechanical theorem proving in elementary geometries. J.Sys.Sci. & Math.Scis. 4(3) 1984, p.207–235.
Wu W. Mechanical Theorem Proving in Elementary Geometry and differential geometry. Proc. 1980 Beijing Simp. on Diff.Geom.& Diff.Eqs vol.2 (1982) Science Press.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ferro, A., Gallo, G. (1989). Grobner bases, Ritt's algorithm and decision procedures for algebraic theories. 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_81
Download citation
DOI: https://doi.org/10.1007/3-540-51082-6_81
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