This is a preview of subscription content, log in via an institution to check access.
Literature Cited
P. S. Novikov, “On the algorithmic unsolvability of the word problem,” Dokl. Akad. Nauk SSSR,85, No. 4, 709–712 (1952).
A. I. Mal'tsev, “Homomorphisms onto finite groups,” in: Selected Works [in Russian], Vol. I, Nauka, Moscow (1976), pp. 450–462.
V. N. Remeslennikov, “An example of a group, finitely presented in the varietyu with unsolvable word problem,” Algebra Logika,12, No. 5, 577–602 (1973).
N. S. Romanovskii, “Some algorithmic problems for solvable groups,” Algebra Logika,13, No. 1, 26–34 (1974).
P. Hall, “Finiteness conditions for soluble groups,” Proc. London Math. Soc.,4, 419–436 (1954).
M. I. Kargapolov et al., “Algorithmic questions forO-powered groups,” Algebra Logika,8, No. 6, 643–659 (1969).
Additional information
Institute of Mathematics, Siberian Branch, Academy of Sciences of the USSR, Novsibirsk. Translated from Sibirskii Matematicheskii Zhurnal, Vol. 21, No. 2. pp. 170–174, March–April, 1980.
Rights and permissions
About this article
Cite this article
Romanovskii, N.S. The occurrence problem for extensions of Abelian groups by nilpotent groups. Sib Math J 21, 273–276 (1980). https://doi.org/10.1007/BF00968275
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00968275