Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

A formal quantifier elimination for algebraically closed fields

Cyril Cohen 1, 2, 3 Assia Mahboubi 1, 2, 3
Abstract : We prove formally that the first order theory of algebraically closed fields enjoy 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.
Complete list of metadatas
Contributor : Cyril Cohen <>
Submitted on : Tuesday, March 16, 2010 - 3:39:32 PM
Last modification on : Wednesday, March 27, 2019 - 4:41:28 PM
Document(s) archivé(s) le : Friday, October 19, 2012 - 10:00:26 AM


Files produced by the author(s)


  • HAL Id : inria-00464237, version 1


Cyril Cohen, Assia Mahboubi. A formal quantifier elimination for algebraically closed fields. 2010. ⟨inria-00464237v1⟩



Record views


Files downloads