This is a preview of subscription content, log in via an institution to check access.
References
A. T. Nurtazin, “Strong and weak constructivizations,”Algebra Logika, 13, No. 3, 311–323 (1974).
S. S. Goncharov, “Autostability and computable families of constructivizations,”Algebra Logika, 14, No. 6, 647–680 (1975).
S. S. Goncharov, “On the number of nonautoequivalent constructivizations,”Algebra Logika, 18, No. 3, 257–282 (1977).
Ju. L. Ershov,Problems of Decidability and Constructive Models [in Russian], Nauka, Moscow (1980).
Ju. L. Ershov,Theory of Numerations [in Russian], Nauka, Moscow (1977).
S. S. Goncharov and V. D. Dzgoev, “Autostability of models,”Algebra Logika, 19, No. 1, 45–58 (1980).
S. S. Goncharov, “Autostability of models and abelian groups,”Algebra Logika, 19, No. 1, 23–44 (1980).
O. V. Kudinov, “Complete systems of finite approximations of sets from the class Σ 02 ,”Vychisl. Sist., No. 139, 111–116 (1992).
A. I. Mal'tsev,Algorithms and Recursive Functions [in Russian], Nauka, Moscow (1986).
C. J. Ash, “Stability of recursive structures in arithmetical degrees,” in:Logic Paper of Monash University (1986), Preprint No. 59a.
Additional information
Translated fromAlgebra i Logika, Vol. 31, No. 5, pp. 479–492, September–October, 1992.
Translated by A. Mal'tsev
Rights and permissions
About this article
Cite this article
Kudinov, O.V. Criteria of autostability for 1-decidable models. Algebr Logic 31, 284–292 (1992). https://doi.org/10.1007/BF02259824
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02259824