On the Complexity of the Classification Problem for Torsion-Free Abelian Groups of Finite Rank

DOI10.2307/2687752zbMath1006.20042OpenAlexW1971295898MaRDI QIDQ2778661

Simon Thomas

Publication date: 12 December 2002

Published in: Bulletin of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: http://www.math.ucla.edu/~asl/bsl/0703-toc.htm

zbMATH Keywords

complexityrigid groupsfinite rank torsion-free Abelian groupsdescriptive set theorycomplete sets of invariantsBorel equivalences

Mathematics Subject Classification ID

Applications of logic to group theory (20A15) Descriptive set theory (03E15) Torsion-free groups, finite rank (20K15)

Related Items

Classes of Ulm type and coding rank-homogeneous trees in other structures ⋮ The classification problem for simple unital finite rank dimension groups ⋮ Uncountable structures are not classifiable up to bi-embeddability ⋮ Omitting types and AF algebras ⋮ Measuring the classification difficulty of countable torsion-free Abelian groups. ⋮ Computable embeddings and strongly minimal theories ⋮ Embedding solenoids in foliations

Cites Work

• Unnamed Item
• On the complexity of the isomorphism relation for finitely generated groups
• Orbit equivalence rigidity
• Primitive torsionsfreie Abelsche Gruppen vom endlichen Range
• Abelian groups without elements of finite order
• A Borel reductibility theory for classes of countable structures
• On Direct Decomposition of Torsion Free Abelian Groups.
• Kazhdan Groups, Cocycles and Trees
• Linear algebraic groups and countable Borel equivalence relations
• Borel equivalence relations and classifications of countable models