Consider the theory of integers with equality, a constant 0 and the successor operation. In other words, that's a theory with axioms
- { axioms of equality },
- $\forall x \forall y (S(x) = S(y) \rightarrow x = y)$,
- $\forall x \exists y (S(y) = x)$,
- $\forall x \lnot (x = S(x))$,
- $\forall x \lnot (x = S(S(x)))$,
- $\forall x \lnot (x = S(S(S(x))))$,
- and countably infinite number of similar axioms each stating that $k$ applications of $S$ don't cycle.
What would be the models of this theory?
Clearly, one example is $\mathbb{R}$ with the natural interpretation. It just decomposes to $\mathbb{Z} \times \mathbb{R}$, so we have $\mathfrak{c}$ copies of $\mathbb{Z}$ that don't care about each other. This suggests that for every uncountable cardinality $\alpha$ we can do something similar and decompose that into $\mathbb{Z} \times \alpha$ (and similarly for countable models of the form $\mathbb{Z} \times k$, where $k$ is finite or countably infinite). But is there anything else?
If there is, how does it look? If there isn't, does it mean that this theory is uncountably categorical? The latter would be interesting, since this theory clearly isn't countably categorical.
Yes, a decomposition like this is always possible. Just look at the equivalence classes under the relation $x\sim y$ iff there is an $n$ such that $S^n(x) = y$ or vice versa. So all models can be expressed as disjoint copies of $\mathbb Z.$ It follows that the theory is $\kappa$-categorical for any uncountable $\kappa,$ but not $\aleph_0$-categorical (since the models with finitely many copies will not be isomorphic to each other or to models with countably infinite numbers of copies).