On the equivalence of two quantifier elimination tests

2007/02/13 by Yimu Yin, Yin, Yimu
Biochemistry, Genetics and Molecular Biology · Computer Science · Mathematics · #Computability, Logic, AI Algorithms #DNA and Biological Computing #math.LO #msc:03C55 #semigroups and automata theory

paper · pdf · doi:10.48550/arxiv.math/0702376

arxiv created 2007/02/13 · arxiv updated 2009/12/01

Abstract

We prove that, for countable languages, two model-theoretic quantifier elimination tests, one proposed by J. R. Shoenfield and the other by L. van den Dries, are equivalent.

Related

• Quantifier Elimination for Statistical Problems
• Quantifier Elimination For Tame Fields
• From Saturated Embedding Tests to Explicit Algorithms
• Quantifier elimination for the reals with a predicate for the powers of two
• The Dual of Quantifier Elimination: Boolean Elimination over C and R