The computational complexity of torsion-freeness of finitely presented groups
The computational complexity of torsion-freeness of finitely presented groups
复制标题
有限群的无扭性的计算复杂度
DOI：
10.1017/s0004972700031014
复制
发表时间：
1997
影响因子：
0.7
通讯作者：
S. Lempp
中科院分区：
文献类型：
--
作者：
S. Lempp
我们确定 Kleene 算术层次结构中有限呈现群的无扭转复杂性为 完备的。这特别意味着不存在所有无扭转有限呈现群或所有非无扭转有限呈现群的有效列表。
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.