Decidability and Computability of Certain Torsion-Free Abelian Groups

We study completely decomposable torsion-free abelian groups of the form GS := nSQpn for sets S . We show that GS has a decidable copy if and only if S is 0 2 and has a computable copy if and only if S is 0 3.

• Type: Journal
• Year: 2010
• Where: NDJFL
• Authors: Rodney G. Downey, Sergei S. Goncharov, Asher M. Kach, Julia F. Knight, Oleg V. Kudinov, Alexander G. Melnikov, Daniel Turetsky
• Keywords: Computable Copy, Computer Networks, Decidable Copy, NDJFL 2010, Torsion-free Abelian Groups