For a first-order theory , suppose every existential quantifier-free formula over a common substructure has a witness in either of two -models exactly when it has one in the other. Then has quantifier elimination. One may test a single quantified variable, since elimination of these formulas inductively eliminates all quantifiers. A language with a constant avoids empty-generated-substructure and quantifier-free-sentence conventions.
If has algebraically prime models and every inclusion between models of is a simple closure, then has quantifier elimination. For a common base , embed its algebraically prime extension into both models. Simple closure transfers a witness into that extension; the second embedding transfers it to the other model.
Articles by others on the same topic
There are currently no matching articles.