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).
V. N. Remeslennikov, "An example of a group, finitely presented in the variety, with unsolvable word problem," Algebra Logika,12, No. 5, 577–602 (1973).
S. I. Adyan, "Unsolvability of certain algorithmic problems of group theory," Tr. Mosk. Mat. Obsch.,6, 231–298 (1957).
P. Hall, "On the finiteness of certain soluble groups," Proc. London Math. Soc.,9, 595–622 (1959).
A. S. Kirkinskii and V. N. Remeslennikov, "The isomorphism problem for solvable groups," Mat. Zametki,18, No. 3, 437–443 (1975).
G. P. Kukin, "Algorithmic problems for solvable Lie algebras," Algebra Logika,17, No. 4, 402–415 (1978).
A. I. Mal'tsev, Algorithms and Recursive Functions [in Russian], Nauka, Moscow (1965).
W. Magnus, A. Karrass, and D. Solitar, Combinatorial Group Theory [Russian translation], Nauka, Moscow (1974).
Additional information
Translated from Algebra i Logika, Vol. 18, No. 3, pp. 259–285, May–June, 1979.
Rights and permissions
About this article
Cite this article
Epanchintsev, V.I., Kukin, G.P. The word problem in a variety of groups containing . Algebra and Logic 18, 157–174 (1979). https://doi.org/10.1007/BF01674421
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01674421