Publisher
Springer Science and Business Media LLC
Reference10 articles.
1. S. I. Adjan, The algorithmic unsolvability of checking certain properties of groups. Dokl. Akad. Nauk. SSSR103, 533?535 (1955) (in Russian).
2. C. R. J. Clapham, Finitely presented groups with word problem of arbitrary degrees of unsolvability. Proc. London Math. Soc.14, 633?676 (1964).
3. C. R. J. Clapham, An embedding theorem for finitely generated groups. Proc. London Math. Soc.17, 419?430 (1967).
4. D. J. Collins, On recognizing properties of groups which have solvable word problems. Arch. Math.21, 31?39 (1970).
5. D. J.Collins, The word, power and order problems in finitely presented groups, in Word Problems (ed. Boone). Amsterdam-London 1973.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献