The decomposability problem for torsion-free abelian groups is analytic-complete

DOI10.1090/PROC/12509MaRDI QIDQ5255271zbMATH OpenOpenAlexFDO

Authors Kyle Riggs

Publication date 12 June 2015

Published in Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1311.1865

zbMATH Keywords

decomposable torsion-free abelian group

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Torsion-free groups, finite rank (20K15) Torsion-free groups, infinite rank (20K20)

Abstract: We discuss the decomposability of torsion-free abelian groups. We show that among computable groups of finite rank this property is $Sigm{a}_3^0$-complete. However, when we consider groups of infinite rank, it becomes $Sigm{a}_1^1$-complete, so it cannot be characterized by a first-order formula in the language of arithmetic.

Recommendations

• Decidability and computability of certain torsion-free abelian groups
• Enumerations and completely decomposable torsion-free abelian groups
• Effectively completely decomposable Abelian groups.
• Computable completely decomposable groups
• Torsion-free abelian groups are consistently $ {\rm a}\Delta ^1_2$-complete

Cites work

• Computable completely decomposable groups
• Decidability and computability of certain torsion-free abelian groups
• Effectively categorical abelian groups
• scientific article; zbMATH DE number 3162956 (Why is no real title available?)
• scientific article; zbMATH DE number 1303204 (Why is no real title available?)
• The isomorphism problem for torsion-free abelian groups is analytic complete

Cited in

(14)

• Effectively completely decomposable Abelian groups.
• Decomposability and computability
• The computational complexity of module socles
• Using computability to measure complexity of algebraic structures and classes of structures
• Torsion-free abelian groups with optimal Scott families
• AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES
• Decompositions of decidable abelian groups
• Characterizations of cancellable groups
• ON THE COMPLEXITY OF CLASSIFYING LEBESGUE SPACES
• The complexity of decomposability of computable rings
• Effectiveness of Walker's cancellation theorem
• Computable formal contexts
• Enumerations and completely decomposable torsion-free abelian groups
• The isomorphism problem for torsion-free abelian groups is analytic complete

This page was built for publication: The decomposability problem for torsion-free abelian groups is analytic-complete

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5255271)