Past exam of the mathematics course of the University of Cambridge / 2015 / iii / Paper 23 / 5 / e / i

Use the first-order language with one constant $c$, take $\mathcal{M}=(\mathbb{N},c=0)$ with equality only, and let $A=\varnothing$. SetThis complete type contains $x=c$ and is isolated by that formula. In any first-order structure, at most one element can satisfy $x=c$. In every $\mathcal{N}\equiv \mathcal{M}$, its interpretation of $c$ realizes $P$, by elementary equivalence. Hence no elementarily equivalent model has infinitely many realizations of $P$. An algebraic type can have a fixed finite number of realizations in every model.