Author:
Gupta Ch. K.,Romanovskii N. S.
Publisher
Springer Science and Business Media LLC
Reference8 articles.
1. V. N. Remeslennikov, “An example of a finitely presented group in the variety $$\mathfrak{A}^5$$ with undecidable word problem,” Algebra Logika, 12, No.5, 577–602 (1973).
2. O. G. Kharlampovich, “Finitely presented solvable group with undecidable word problem,” Izv. Akad. Nauk SSSR, Ser. Mat., 45, No.4, 852–873 (1981).
3. V. I. Epanchintsev and G. P. Kukin, “The word problem in a variety of groups containing $$\mathfrak{N}_2 \mathfrak{A}$$ ,” Algebra Logika, 18, No.3, 259–285 (1979).
4. A. I. Mal'tsev, “Two remarks on nilpotent groups,” Mat. Sb., 37(79), 567–572 (1955).
5. N. S. Romanovskii, “Algorithmic problems for solvable groups,” Algebra Logika, 13, No.1, 26–34 (1974).
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Algorithmic theory of solvable groups;Prikladnaya Diskretnaya Matematika;2021