A formal quantifier elimination for algebraically closed fields

The final publication is available at www.springerlink.comInternational audienceWe 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

Imaginaries in separably closed valued fields

We show that separably closed valued fields of finite imperfection degree (either with lambda-functions or commuting Hasse derivations) eliminate imaginaries in the geometric language. We then use this classification of interpretable sets to study stably dominated types in those structures. We show that separably closed valued fields of finite imperfection degree are metastable and that the space of stably dominated types is strict pro-definable

On function field Mordell-Lang and Manin-Mumford

We present a reduction of the function field Mordell-Lang conjecture to the function field Manin-Mumford conjecture, in all characteristics, via model theory, but avoiding recourse to the dichotomy theorems for (generalized) Zariski structures. In this version 2, the quantifier elimination result in positive characteristic is extended from simple abelian varieties to all abelian varieties, completing the main theorem in the positive characteristic case. In version 3, some corrections are made to the proof of quantifier elimination in positive characteristic, and the paper is substantially reorganized.Comment: 21 page