Article PDF
Avoid common mistakes on your manuscript.
Literature Cited
S. S. Goncharov, “The problem of number of nonautoequivalent constructivizations,” Dokl. Akad. Nauk SSSR,251, No. 2, 271–274 (1980).
S. S. Goncharov, “One-valued computable numerations,” Algebra Logika,19, No. 5, 507–551 (1980).
S. S. Goncharov, “Groups with finitely many constructivizations,” Dokl. Akad. Nauk SSSR,256, No. 2, 269–272 (1981).
S. S. Goncharov, “Limit-equivalent constructivizations,” in: Mathematical Logic and Theory of Algorithms [in Russian], Vol. 2, Tr. Inst. Mat. AN SSSR, Sib. Otd. (1982).
A. I. Mal'tsev, “On recursive Abelian groups,” Dokl. Akad. Nauk SSSR,146, No. 5, 1009–1012 (1962).
C. Lin, “Recursively presented Abelian groups of effective p-group theory. I,” J. Symbolic Logic,46, No. 3, 617–624 (1981).
LaRoche, “Recursively presented Boolean algebras,” NAMS,24, No. 46, 552 (1978).
A. Manaster and J. B. Remmel, “Recursively categorical decidable dense two-dimensional partial orderings,” in: Aspects of Effective Algebra: Proc. of a Conference at Menash University, Australia, 1–4 August, 1979.
J. B. Remmel, “Recursive isomorphism types of recursive Boolean algebras,” J. Symbolic Logic,46, No. 3, 572–594 (1981).
J. B. Remmel, “Recursively categorical linear orderings,” Proc. Am. Math. Soc.,83, No. 2, 387–391 (1981).
R. L. Smith, “Two theorems on autostability in p-groups,” in: Lect. Notes in Math., Springer-Verlag, Vol. 859 (1981), pp. 302–311.
M. I. Kargapolov and Yu. I. Merzlyakov, Fundamentals of Group Theory [in Russian], Nauka, Moscow (1977).
H. Neumann, Varieties of Groups [Russian translation], Mir, Moscow (1969).
Yu. L. Ershov, Decidability Problems and Constructive Models [in Russian], Nauka, Moscow (1980).
A. I. Mal'tsev, Algorithms and Recursive Functions [in Russian], Nauka, Moscow (1969).
Additional information
Novosibirsk. Translated from Sibirskii Matematicheskii Zhurnal, Vol. 30, No. 1, pp. 82–88, January–February, 1989.
Rights and permissions
About this article
Cite this article
Goncharov, S.S., Molokov, A.V. & Romanovskii, N.S. Nilpotent groups of finite algorithmic dimension. Sib Math J 30, 63–68 (1989). https://doi.org/10.1007/BF01054216
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01054216