Constructive models of uncountably categorical theories
Bernhard Herwig, Steffen Lempp, Martin Ziegler · Proceedings of the American Mathematical Society · 1999
We construct a strongly minimal (and thus uncountably categorical) but not totally categorical theory in a finite language of binary predicates whose only constructive (or recursive) model is the prime model.