This is a preview of subscription content, log in via an institution to check access.
Literature cited
V. A. Uspenskii and A. L. Semenov, “Theory of algorithms: its basic discoveries and applications,” in: Algorithms in Modern Mathematics and Its Applications [in Russian], Part 1, Novosibirsk (1982).
S. S. Goncharov, “The algorithmic dimension of abelian groups,” in: Abstracts of the Communications of the 17th All-Union Algebraic Conference (Minsk, September 14–17, 1983) [in Russian], Inst. Mat. Akad. Nauk BSSR, Minsk, p. 51.
S. S. Goncharov, “The problem of the number of nonautoequivalent constructivizations,” Algebra Logika,19, No. 6, 621–639 (1980).
Yu. L. Ershov, Decision Problems and Constructivizable Models [in Russian], Nauka, Moscow (1980).
Author information
Authors and Affiliations
Additional information
Translated from Matematicheskie Zametki, Vol. 48, No. 6, pp. 106–111, December, 1990.
Rights and permissions
About this article
Cite this article
Fedoryaev, S.T. Constructivizable models with a linear structure of algebraic reducibility. Mathematical Notes of the Academy of Sciences of the USSR 48, 1245–1249 (1990). https://doi.org/10.1007/BF01240268
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01240268