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 |
---|---|
Other Authors: | School of Physical and Mathematical Sciences |
Format: | Article |
Language: | English |
Published: |
2020
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/137680 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Finite automata presentable abelian groups
by: Nies, A., et al.
Published: (2014) -
Unique sums and differences in finite Abelian groups
by: Leung, Ka Hin, et al.
Published: (2022) -
On the uniqueness of the decomposition of finite abelian groups: A simple proof
by: Ramchandani, Divya H., et al.
Published: (2007) -
Table splitting of classifying spaces of elementary abelian p-groups
by: Nguyen Gia Dinh
Published: (2017) -
Hypercyclic products of HCA-groups
by: Medenilla, Mark Anthony
Published: (2020)