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

DOI10.1016/j.jalgebra.2008.06.007zbMath1156.03042OpenAlexW2171894804MaRDI QIDQ952542

Antonio Montalbán, Rodney G. Downey

Publication date: 12 November 2008

Published in: Journal of Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jalgebra.2008.06.007

zbMATH Keywords

complexityisomorphism problemtorsion-free abelian groups

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Torsion-free groups, infinite rank (20K20) Word problems, etc. in computability and recursion theory (03D40) Torsion-free groups, finite rank (20K15)

Related Items (39)

Three topological reducibilities for discontinuous functions ⋮ Classes of Ulm type and coding rank-homogeneous trees in other structures ⋮ Effectively categorical abelian groups ⋮ The Birth and Early Years of Parameterized Complexity ⋮ On the isomorphism problem for some classes of computable algebraic structures ⋮ Computable completely decomposable groups ⋮ There is no classification of the decidably presentable structures ⋮ Torsion-free abelian groups with optimal Scott families ⋮ The Borel complexity of von Neumann equivalence ⋮ THE COMPLEXITY OF THE EMBEDDABILITY RELATION BETWEEN TORSION-FREE ABELIAN GROUPS OF UNCOUNTABLE SIZE ⋮ THE CLASSIFICATION PROBLEM FOR AUTOMORPHISMS OF C*-ALGEBRAS ⋮ \(\mathrm{W}^*\)-rigidity paradigms for embeddings of \(\mathrm{II}_1\) factors ⋮ Computable elements and functions in effectively enumerable topological spaces ⋮ The complexity of decomposability of computable rings ⋮ Computable Stone spaces ⋮ Enumerating abelian \(p\)-groups ⋮ A Friedberg enumeration of equivalence structures ⋮ Anti-classification results for groups acting freely on the line ⋮ On Constructive Nilpotent Groups ⋮ A class of II\(_{1}\) factors with many non conjugate Cartan subalgebras ⋮ The complexity of computable categoricity ⋮ Isomorphism relations on computable structures ⋮ Jump degrees of torsion-free abelian groups ⋮ The bi-embeddability relation for countable abelian groups ⋮ Equivalence Relations on Classes of Computable Structures ⋮ Localized cohomology and some applications of Popa's cocycle superrigidity theorem ⋮ The computable embedding problem ⋮ Complexity of the isomorphism problem for computable free projective planes of finite rank ⋮ A note on computable distinguishing colorings ⋮ COMPUTABLE ABELIAN GROUPS ⋮ Computable topological groups and Pontryagin duality ⋮ AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES ⋮ CLASSES OF STRUCTURES WITH NO INTERMEDIATE ISOMORPHISM PROBLEMS ⋮ Decompositions of decidable abelian groups ⋮ Categorical linearly ordered structures ⋮ ON THE COMPLEXITY OF CLASSIFYING LEBESGUE SPACES ⋮ The decomposability problem for torsion-free abelian groups is analytic-complete ⋮ Computable topological abelian groups ⋮ Computable analysis and classification problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hierarchies of torsion-free Abelian groups
• On the integral homology of finitely presented groups
• Extending partial orders to dense linear orders
• Cohomological topics in group theory.
• A Borel reductibility theory for classes of countable structures
• On the orbits of computably enumerable sets
• The isomorphism problem for computable Abelian _p-groups of bounded length
• Classification from a Computable Viewpoint
• The computational complexity of torsion-freeness of finitely presented groups
• The classification problem for torsion-free abelian groups of finite rank
• The isomorphism relation on countable torsion free abelian groups
• Higher Recursion Theory
• Recursive Pseudo-Well-Orderings
• A Finitely Presented Group Whose 3-Dimensional Integral Homology is not Finitely Generated

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