Abstract:
We construct an example of a theory with a finite (greater than one) number of isomorphism types of countable models such that its prime and saturated models have computable presentations and there exists a model which lacks in such.
Keywords:Ehrenfeucht theory, countable model, computable presentation of a model.