Unsolvability of the universal theory of finite groups
- 63 Downloads
KeywordsInduction Hypothesis Finite Group Infinite Number Word Problem Periodic Group
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- 1.Kourovska Notebook [in Russian], Novosibirsk (1973).Google Scholar
- 2.A. A. Markov, "The theory of algorithms," Tr. Mat. Inst. Akad. Nauk SSSR, Izd. Akad. Nauk SSSR,42, Moscow (1954).Google Scholar
- 3.P. S. Novikov, "On the algorithmic unsolvability of the word problem in theory of groups," Tr. Mat. Inst. Akad. Nauk SSSR, Izd. Akad. Nauk SSSR,44, Moscow (1955).Google Scholar
© Plenum Publishing Corporation 1982