Abstract
A certain class of models of infinite algorithmic dimension is described; included in the class are branching and unbounded models.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
S. S. Goncharov, “Autostability of models and Abelian groups,”Algebra Logika,19, No. 1, 23–44 (1980).
S. S. Goncharov and V. D. Dzgoev, “Autostability of models,”Algebra Logika,19, No. 9, 45–58 (1980).
Yu. G. Ventsov, “Algorithmic properties of branching models,”Algebra Logika,25, No. 9, 369–383 (1980).
Yu. G. Ventsov, “Computable classes of constructivizations for models of infinite algorithmic dimension,”Algebra Logika,33, No. 1, 37–75 (1994).
Yu. G. Ventsov, “Constructive models of infinite algorithmic dimension,” to appear in:Dokl. Ros. Akad. Nauk.
S. S. Goncharov, “The problem of the number of non-autoequivalent constructivizations,”Dokl. Akad. Nauk. SSSR,251, No. 2, 271–274 (1980).
Yu. L. Ershov,Decidability Problems and Constructive Models [in Russian], Nauka, Moscow (1980).
A. I. Mal'tsev, “Constructive models. I,”Usp. Mat. Nauk,16, No. 3, 3–60 (1961).
Yu. G. Ventsov, “Algorithmic dimension of models,”Dokl. Akad. Nauk SSSR,305, No. 1, 21–24 (1989).
Additional information
Translated fromAlgebra i Logika, Vol. 33, No. 2, pp. 135-146, March-April, 1994.
Supported by the Russian Foundation for Fundamental Research.
Rights and permissions
About this article
Cite this article
Ventsov, Y.G. Constructive models of regularly infinite algorithmic dimension. Algebr Logic 33, 79���84 (1994). https://doi.org/10.1007/BF00739993
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00739993