Abstract
We prove formally that the first order theory of algebraically closed fields enjoys quantifier elimination, and hence is decidable. This proof is organized in two modular parts. We first reify the first order theory of rings and prove that quantifier elimination leads to decidability. Then we implement an algorithm which constructs a quantifier free formula from any first order formula in the theory of ring. If the underlying ring is in fact an algebraically closed field, we prove that the two formulas have the same semantic. The algorithm producing the quantifier free formula is programmed in continuation passing style, which leads to both a concise program and an elegant proof of semantic correctness.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Barras, B.: Sets in coq, coq in sets. In: Proceedings of the 1st Coq Workshop. Technical University of Munich Research Report (2009)
Basu, S., Pollack, R., Roy, M.-F.: Algorithms in Real Algebraic Geometry, Algorithms and Computation in Mathematics. Springer, New York (2006)
Berardi, S., Valentini, S.: Krivine’s intuitionistic proof of classical completeness for countable languages. Ann. Pure Appl. Logic 129(1-3), 93–106 (2004)
Bertot, Y., Castéran, P.: Interactive Theorem Proving and Program Development, Coq’Art: the Calculus of Inductive Constructions. Springer, Heidelberg (2004)
Bertot, Y., Gonthier, G., Biha, S.O., Pasca, I.: Canonical big operators. In: Mohamed, O.A., Muñoz, C., Tahar, S. (eds.) TPHOLs 2008. LNCS, vol. 5170, pp. 86–101. Springer, Heidelberg (2008)
Buchberger, B.: Groebner Bases: Applications. In: Mikhalev, A.V., Pilz, G.F. (eds.) The Concise Handbook of Algebra, pp. 265–268. Kluwer Academic Publishers, Dordrecht (2002)
Chevalley, C., Cartan, H.: Schémas normaux; morphismes; ensembles constructibles. In: Séminaire Henri Cartan, Numdam, vol. 8, pp. 1–10 (1955-1956), http://www.numdam.org/item?id=SHC_1955-1956__8__A7_0
Garillot, F., Gonthier, G., Mahboubi, A., Rideau, L.: Packaging mathematical structures. In: Berghofer, S., Nipkow, T., Urban, C., Wenzel, M. (eds.) TPHOLs 2009. LNCS, vol. 5674, pp. 327–342. Springer, Heidelberg (2009)
Geuvers, H., Pollack, R., Wiedijk, F., Zwanenburg, J.: A constructive algebraic hierarchy in Coq. Journal of Symbolic Computation 34(4), 271–286 (2002)
Harrison, J.: Complex quantifier elimination in HOL. In: Boulton, R.J., Jackson, P.B. (eds.) TPHOLs 2001: Supplemental Proceedings, Division of Informatics, University of Edinburgh, pp. 159–174 (2001); Published as Informatics Report Series EDI-INF-RR-0046, http://www.informatics.ed.ac.uk/publications/report/0046.html
Hodges, W.: A shorter model theory. Cambridge University Press, Cambridge (1997)
Gödel, K.: Über die Vollständigkeit des Logikkalküls. PhD thesis, University of Vienna, Austria (1929)
Nipkow, T.: Linear quantifier elimination. In: Armando, A., Baumgartner, P., Dowek, G. (eds.) IJCAR 2008. LNCS (LNAI), vol. 5195, pp. 18–33. Springer, Heidelberg (2008)
O’Connor, R.: Incompleteness & Completeness, Formalizing Logic and Analysis in Type Theory. PhD thesis, Radboud University Nijmegen, Netherlands (2009)
Pottier, L.: Connecting gröbner bases programs with coq to do proofs in algebra, geometry and arithmetics. In: LPAR Workshops. CEUR Workshop Proceedings, vol. 418. CEUR-WS.org (2008)
Ridge, T., Margetson, J.: A mechanically verified, sound and complete theorem prover for first order logic. In: Hurd, J., Melham, T. (eds.) TPHOLs 2005. LNCS, vol. 3603, pp. 294–309. Springer, Heidelberg (2005)
Robinson, J.: Definability and decision problems in arithmetic. Journal of Symbolic Logic 14, 98–114 (1949)
Simpson, C.T.: Formalized proof, computation, and the construction problem in algebraic geometry (2004)
Tarski, A.: A decision method for elementary algebra and geometry. In: RAND Corp., Santa Monica, CA (1948) (manuscript); Republished as A Decision Method for Elementary Algebra and Geometry, 2nd edn. University of California Press, Berkeley (1951)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cohen, C., Mahboubi, A. (2010). A Formal Quantifier Elimination for Algebraically Closed Fields. In: Autexier, S., et al. Intelligent Computer Mathematics. CICM 2010. Lecture Notes in Computer Science(), vol 6167. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14128-7_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-14128-7_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14127-0
Online ISBN: 978-3-642-14128-7
eBook Packages: Computer ScienceComputer Science (R0)