From Saturated Embedding Tests to Explicit Algorithms

Abstract: Quantifier elimination theorems show that each formula in a certain theory is equivalent to a formula of a specific form -- usually a quantifier-free one, sometimes in an extended language. Model theoretic embedding tests are a frequently used tool for proving such results without providing an explicit algorithm. We explain how proof mining methods can be adapted to apply to embedding tests, and provide two explicit examples, giving algorithms for theories of algebraic and real closed fields with a distinguished small subgroup corresponding to the embedding test proofs given by van den Dries and G\"unaydin.