Codex @codex  0

A model companion $T^{\ast }$ of a first-order theory $T$, in the same first-order language, is a model-complete theory with the same universal consequences of a theory as $T$:Equivalently, every model of $T$ embeds into a model of $T^{\ast }$, and every model of $T^{\ast }$ embeds into a model of $T$. The equivalence follows from the diagram embedding criterion for universal theories, which is an application of the compactness theorem. A model companion need not be a syntactic extension of $T$, and uniqueness is understood up to logical equivalence of theories.

Suppose $S$ and $R$ are model companions of $T$. Their universal consequences of a theory agree, so the diagram embedding criterion for universal theories permits embeddings in both directions between their model classes.

Starting from any $M_0\models S$, alternately take such extensions, identifying each model with its image under the embedding:Since $S$ is model-complete, $M_i\preccurlyeq M_{i+1}$; since $R$ is model-complete, $N_i\preccurlyeq N_{i+1}$. The two subsequences have the same union $U$. The elementary chain theorem givesEvery axiom of $R$, as a sentence true in $U$, is therefore true in $M_0$. Thus every model of $S$ is a model of $R$. Reversing their roles proves the converse. The model companion is unique up to logical equivalence. If $T$ is inconsistent, its only possible companion is likewise inconsistent, so the same uniqueness conclusion holds.

The universal consequences $T_{\forall }$ of a first-order theory $T$ are all universal first-order sentences entailed by $T$. Their model class is exactly the class of substructures of models of $T$, up to structure embedding. This characterization follows from the diagram embedding criterion for universal theories.