Constructivizability of a prime model (Q1071755)

We study the question of the constructivizability of a prime model of a complete decidable theory. \textit{S. S. Goncharov} and \textit{A. T. Nurtazin} [Algebra Logika 12, 125-142 (1973; Zbl 0278.02038)] constructed an example of a complete decidable theory with a nonconstructivizable prime model. All models of this theory which are prime over a finite set are not constructivizable either. The following question arises naturally: if a complete decidable theory has a prime model and a strongly destructivizable model which is prime over a finite set, will the prime model be constructivizable? In this paper we will show that in general the answer to this question is negative. We also construct an example of a complete decidable theory which has a constructivizable but not a strongly constructivizable prime model.