Computable torsion abelian groups
We prove that c.c. torsion abelian groups can be described by a Π04-predicate that describes the failure of a brute-force diagonalisation attempt on such groups. We show that there is no simpler description since their index set is Π04-complete. The results can be viewed as a solution to a 60 year-o...
Saved in:
Main Authors: | Melnikov, Alexander G., Ng, Keng Meng |
---|---|
其他作者: | School of Physical and Mathematical Sciences |
格式: | Article |
語言: | English |
出版: |
2020
|
主題: | |
在線閱讀: | https://hdl.handle.net/10356/137680 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Nanyang Technological University |
語言: | English |
相似書籍
-
Finite automata presentable abelian groups
由: Nies, A., et al.
出版: (2014) -
Unique sums and differences in finite Abelian groups
由: Leung, Ka Hin, et al.
出版: (2022) -
On the uniqueness of the decomposition of finite abelian groups: A simple proof
由: Ramchandani, Divya H., et al.
出版: (2007) -
Table splitting of classifying spaces of elementary abelian p-groups
由: Nguyen Gia Dinh
出版: (2017) -
Hypercyclic products of HCA-groups
由: Medenilla, Mark Anthony
出版: (2020)