This is a preview of subscription content, log in via an institution to check access.
References
A. I. Mal'tsev, “On recursive abelian groups,”Dokl. Akad. Nauk SSSR,146, No. 5, 1009–1012 (1962).
S. S. Goncharov, “Autostability of models and abelian groups,”Algebra Logika,19, No. 1, 23–24 (1980).
S. S. Goncharov and V. D. Dzgoev, “Autostability of models,”Algebra Logika,19, No. 2, 45–58 (1980).
S. S. Goncharov, “The problem of the number of non-autoequivalent constructivizations,”Algebra Logika,19, No. 6, 621–639 (1980).
S. S. Goncharov, “One-to-one computable numerations,”Algebra Logika,19, No. 5, 507–511 (1980).
Yu. G. Ventsov, “Algorithmic properties of branching models,”Algebra Logika,25, No. 4, 369–383 (1986).
Yu. G. Ventsov, “A family of recursively enumerable sets with finite classes of nonequivalent one-to-one computable numerations,”Vychisl. Sist.,”120, 105–142 (1987).
Logical Notebook.Unsolved Problems in Mathematical Logic [in Russian], Institute of Mathematics, Novosibirsk (1986).
Yu. G. Ventsov, “Nonuniform autostability of models,”Algebra Logika,26, No. 6, 422–440 (1987).
Yu. L. Ershov,Decidability Problems and Constructive Models [in Russian], Nauka, Moscow (1980).
Additional information
Translated fromAlgebra i Logika, Vol. 33, No. 1, pp. 37–75, January–February, 1994.
Supported by the Russian Foundation for Fundamental Research, grant No. 93-011-1506.
Rights and permissions
About this article
Cite this article
Ventsov, Y.G. Computable classes of constructivizations for models of infinite algorithmic dimension. Algebr Logic 33, 22–45 (1994). https://doi.org/10.1007/BF00739415
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00739415