Article contents
The computational complexity of torsion-freeness of finitely presented groups
Published online by Cambridge University Press: 17 April 2009
Abstract
We determine the complexity of torsion-freeness of finitely presented groups in Kleene's arithmetical hierarchy as -complete. This implies in particular that there is no effective listing of all torsion-free finitely presented groups, or of all non-torsion-free finitely presented groups.
- Type
- Research Article
- Information
- Bulletin of the Australian Mathematical Society , Volume 56 , Issue 2 , October 1997 , pp. 273 - 277
- Copyright
- Copyright © Australian Mathematical Society 1997
References
- 8
- Cited by