Article PDF
Avoid common mistakes on your manuscript.
Literature cited
S. S. Goncharov and A. T. Nurtazin, "Constructive models of complete solvable theories," Algebra i Logika,12, No. 2, 125–142 (1973).
Yu. L. Ershov, "Constructive models," in: Selected Topics in Algebra and Mathematical Logic, Novosibirsk (1972).
A. I. Mal'tsev, Algebraic Systems [in Russian], Nauka (1970).
A. I. Mal'tsev, Algorithms and Recursive Functions [in Russian], Nauka (1965).
M. G. Peretyat'kin, "Strongly constructive models and enumerations of a Boolean algebra of recursive sets," Algebra i Logika,10, No. 5, 535–557 (1971).
R. L. Vaught, "Denumerable models of complete theories, Infinistic methods," Proc. Symp. Found. Math., Warsaw (1959).
Additional information
Translated from Algebra i Logika, Vol. 12, No. 5, pp. 550–576, September–October, 1973.
Rights and permissions
About this article
Cite this article
Peretyat'kin, M.G. On complete theories with a finite number of denumerable models. Algebr Logic 12, 310–326 (1973). https://doi.org/10.1007/BF02218589
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02218589