1. P. S. Novikov, "On the algorithmic unsolvability of the word problem," Dokl. Akad. Nauk SSSR,85, No. 4, 709–712 (1952).
2. 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).
3. S. I. Adyan, "Unsolvability of certain algorithmic problems of group theory," Tr. Mosk. Mat. Obsch.,6, 231–298 (1957).
4. P. Hall, "On the finiteness of certain soluble groups," Proc. London Math. Soc.,9, 595–622 (1959).
5. A. S. Kirkinskii and V. N. Remeslennikov, "The isomorphism problem for solvable groups," Mat. Zametki,18, No. 3, 437–443 (1975).