This is a preview of subscription content, log in via an institution to check access.
Literature Cited
Yu. L. Ershov, Solvability Problems and Constructive Models [in Russian], Nauka, Moscow (1980).
H. Rogers, Jr., Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York (1967).
M. I. Kargapolov and Y. I. Merzlyakov, Fundamentals of Group Theory [in Russian], Nauka, Moscow (1982).
R. C. Lyndon and P. E. Schupp, Combinatorial Group Theory, Springer-Verlag Berlin-New York (1977).
P. Hall, The Edmonton Notes on Nilpotent Groups, Queen Mary College Mathematics Notes, Mathematics Department, Queen, Mary College, London (1969).
A. I. Mal'tsev, “On homomorphisms on finite groups,” Uch. Zap. Ivanov. Gos. Pedagog. Inst.,18, No. 5, 49–60 (1958).
O. G. Kharlampovich, “A finitely defined solvable group with unsolvable equality problem,” Izv. Akad. Nauk SSSR,45, No. 4, 852–873 (1981).
M. Hall, The Theory of Groups, Macmillan, New York, (1959).
W. Magnus, A. Karrass, and D. Solitar, Combinatorial Group Theory, Interscience, New York (1966).
Additional information
Novosibirsk. Translated from Sibirskii Matematicheskii Zhurnal, Vol. 28, No. 5, pp. 102–110, September–October, 1987.
Rights and permissions
About this article
Cite this article
Latkin, I.V. Algorithmic complexity of the problem of occurrence in commutants and members of the lower central series. Sib Math J 28, 772–779 (1987). https://doi.org/10.1007/BF00969322
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00969322