This is a preview of subscription content, log in via an institution to check access.
Literature Cited
S. S. Goncharov and A. T. Nurtazin, "Constructive models of complete decidable theories," Algebra Logika,12, No. 2, 125–142 (1973).
Yu. L. Ershov, Theory of Enumerations [in Russian], Part 3, Constructive Models, Novosibirsk (1974).
M. G. Peretyat'kin, "Complete theories with a finite number of countable models," Algebra Logika,12, No. 5, 550–576 (1973).
H. Rogers, Jr., Theory of Recursive Functions and Effective Computability, McGraw-Hill (1967).
G. E. Sacks, Saturated Model Theory, W. A. Benjamin, Reading, Mass. (1972).
L. Harrington, "Recursively presentable prime models," J. Symb. Logic,39, No. 2, 305–309 (1974).
M. Morley, "Decidable models," Israel J. Math.,25, Nos. 3–4, 233–240 (1976).
S. S. Goncharov, "Strong constructivizability of homogeneous models," Algebra Logika,17, No. 4, 363–388 (1978).
Additional information
Translated from Algebra i Logika, Vol. 17, No. 4, pp. 436–454, July–August, 1978.
Rights and permissions
About this article
Cite this article
Peretyat'kin, M.G. Criterion for strong constructivizability of a homogeneous model. Algebra and Logic 17, 290–301 (1978). https://doi.org/10.1007/BF01674780
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01674780