2013/11/08 by Riggs, Kyle
#03C57 #03D45 #FOS: Mathematics #Logic (math.LO)
paper · doi:10.48550/arxiv.1311.1865
We discuss the decomposability of torsion-free abelian groups. We show that among computable groups of finite rank this property is Σ03-complete. However, when we consider groups of infinite rank, it becomes Σ11-complete, so it cannot be characterized by a first-order formula in the language of arithmetic.