The computational complexity of torsion-freeness of finitely presented groups (Q4374809): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Some Unsolvable Problems about Elements and Subgroups of Groups. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3819052 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Recursive unsolvability of group theoretic problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On a Problem of J.H.C. Whitehead and a Problem of Alonzo Church. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4317890 / rank | |||
Normal rank |
Latest revision as of 10:27, 28 May 2024
scientific article; zbMATH DE number 1109619
Language | Label | Description | Also known as |
---|---|---|---|
English | The computational complexity of torsion-freeness of finitely presented groups |
scientific article; zbMATH DE number 1109619 |
Statements
The computational complexity of torsion-freeness of finitely presented groups (English)
0 references
29 May 1998
0 references
torsion-free finitely presented group
0 references
arithmetical hierarchy
0 references