If $T$ is a countable complete first-order theory with infinite models, the number of countable models it has, $I(T,\omega)$, must be an element of $N=\{1,3,4,5,6,7,\dots,\omega,\omega_1,2^\omega\}$ (although we don't know if $\omega_1$ can happen). For which pairs $n,m\in N$ does there exist a countable complete theory $T$ with $n$ countable models but $m$ countable models after adding finitely many constants to the theory? Countably many new constants? In particular can we have $m<n$? EDIT: By 'adding constants,' I mean adding constants whose type is completely specified, i.e. expanding by constants and then passing to a complete theory in the expanded language.

Let $n\rightarrow m$ denote the statement "There exists a complete countable theory $T$ and a finite tuple of constants $\overline{a}$ such that $I(T,\omega)=n$ and $I(T_\overline{a},\omega)=m$." And let $n\rightarrow_\omega m$ denote the statement "There exists a complete countable theory $T$ and a countable set of distinct constants $A$ such that $I(T,\omega)=n$ and $I(T_A,\omega)=m$." Some easy results and relevant observations:

- If $n\rightarrow m$ (resp. $n\rightarrow_\omega m$) and $k \rightarrow \ell$ (resp. $k \rightarrow_\omega \ell$), then $nk \rightarrow m\ell$ (resp. $nk \rightarrow_\omega m\ell$). (Take the disjoint union of the relevant theories.)
- $n \rightarrow n$ for every $n\in N-\{\omega_1\}$. (This is obvious for $n=1$. There are easy examples for $n=\omega,2^\omega$ and the standard examples for $n=3,4,5\dots$ all have constants which do not increase the number of countable models.)
- $n^2+n\rightarrow (n+1)^2$ for any $1<n<\omega$. (DLO with $n-1$ colors and a countable set of constants of order type $\omega + \omega^\ast$. By itself this theory has $n^2 + 1$ countable models. Adding a constant in between $\omega$ and $\omega^\ast$ makes the theory have $(n+1)^2$ models.)
- $1\not\rightarrow n$ and $n\not\rightarrow 1$ for any $n\in N - \{1\}$.
- $1\rightarrow_\omega 2^\omega$ (For example: DLO.)
- $1\rightarrow_\omega \omega$ (For example: A structureless set.)
- $n\not\rightarrow_\omega 1$ for any $n\in N$.
- $1 \rightarrow_\omega n$ for every $2<n<\omega$. (The standard examples of Ehrenfeucht theories are $\omega$-categorical theories with countably many constants added.)
- If a theory is not small, then it will have $2^\omega$ countable models after adding any countable set of constants.

3more comments