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