B2.11

Logic, Computation and Set Theory | Part II, 2002

Explain what is meant by a structure for a first-order language and by a model for a first-order theory. If TT is a first-order theory whose axioms are all universal sentences (that is, sentences of the form (x1xn)p\left(\forall x_{1} \ldots x_{n}\right) p where pp is quantifier-free), show that every substructure of a TT-model is a TT-model.

Now let TT be an arbitrary first-order theory in a language LL, and let MM be an LL-structure satisfying all the universal sentences which are derivable from the axioms of TT. If pp is a quantifier-free formula (with free variables x1,,xnx_{1}, \ldots, x_{n} say) whose interpretation [p]M[p]_{M} is a nonempty subset of MnM^{n}, show that T{(x1xn)p}T \cup\left\{\left(\exists x_{1} \cdots x_{n}\right) p\right\} is consistent.

Let LL^{\prime} be the language obtained from LL by adjoining a new constant a^\widehat{a}for each element aa of MM, and let

T=T{p[a^1,,a^n/x1,,xn]p is quantifier-free and (a1,,an)[p]M}T^{\prime}=T \cup\left\{p\left[\widehat{a}_{1}, \ldots, \widehat{a}_{n} / x_{1}, \ldots, x_{n}\right] \mid p \text { is quantifier-free and }\left(a_{1}, \ldots, a_{n}\right) \in[p]_{M}\right\}

Show that TT^{\prime} has a model. [You may use the Completeness and Compactness Theorems.] Explain briefly why any such model contains a substructure isomorphic to MM.

Typos? Please submit corrections to this page on GitHub.