Universal theories for free solvable groups
Algebra i logika, Tome 51 (2012) no. 3, pp. 385-391

Voir la notice de l'article provenant de la source Math-Net.Ru

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.
@article{AL_2012_51_3_a5,
     author = {N. S. Romanovskii},
     title = {Universal theories for free solvable groups},
     journal = {Algebra i logika},
     pages = {385--391},
     publisher = {mathdoc},
     volume = {51},
     number = {3},
     year = {2012},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/AL_2012_51_3_a5/}
}
TY  - JOUR
AU  - N. S. Romanovskii
TI  - Universal theories for free solvable groups
JO  - Algebra i logika
PY  - 2012
SP  - 385
EP  - 391
VL  - 51
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/AL_2012_51_3_a5/
LA  - ru
ID  - AL_2012_51_3_a5
ER  - 
%0 Journal Article
%A N. S. Romanovskii
%T Universal theories for free solvable groups
%J Algebra i logika
%D 2012
%P 385-391
%V 51
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/AL_2012_51_3_a5/
%G ru
%F AL_2012_51_3_a5
N. S. Romanovskii. Universal theories for free solvable groups. Algebra i logika, Tome 51 (2012) no. 3, pp. 385-391. http://geodesic.mathdoc.fr/item/AL_2012_51_3_a5/