Past exam of the mathematics course of the University of Cambridge / 2015 / iii / Paper 23 / 3 / a

A first-order theory $T$ is model-complete if every structure embedding between models of $T$ is an elementary embedding. Equivalently, whenever $\mathcal{M}\subseteq \mathcal{N}$ and both satisfy $T$, one has $\mathcal{M}\preccurlyeq \mathcal{N}$:for every first-order formula $\phi$ and every finite tuple $\bar{a}\in M$. This is preservation of all formulas with parameters, rather than merely all first-order sentences.