Some algorithmic problems for relatively free groups (Q1126539)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Some algorithmic problems for relatively free groups |
scientific article; zbMATH DE number 955862
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Some algorithmic problems for relatively free groups |
scientific article; zbMATH DE number 955862 |
Statements
Some algorithmic problems for relatively free groups (English)
0 references
10 December 1996
0 references
It is shown that within the class of \(2\)-generator, finitely presented solvable groups, torsion-freeness is unrecognizable. Related results are also obtained.
0 references
finitely presented solvable groups
0 references
undecidable torsion-freeness
0 references
word problems
0 references
0 references
0 references
