|
This article is cited in 7 scientific papers (total in 7 papers)
Universal theories for free solvable groups
N. S. Romanovskiiab a Sobolev Institute of Mathematics, Siberian Branch, Russian Academy of Sciences, Novosibirsk, Russia
b Novosibirsk State University, Novosibirsk, Russia
Abstract:
It is proved that a free solvable group of derived length at least 4 has an algorithmically undecidable universal theory.
Keywords:
universal theory, decidable theory, free solvable group.
Received: 07.02.2012
Citation:
N. S. Romanovskii, “Universal theories for free solvable groups”, Algebra Logika, 51:3 (2012), 385–391; Algebra and Logic, 51:3 (2012), 259–263
Linking options:
https://www.mathnet.ru/eng/al541 https://www.mathnet.ru/eng/al/v51/i3/p385
|
|