On the complexity of the isomorphism relation for finitely generated groups

DOI10.1006/jabr.1998.7825zbMath0938.03060OpenAlexW2043152523MaRDI QIDQ1305085

Simon Thomas, Boban Velickovic

Publication date: 22 September 1999

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

Full work available at URL: https://semanticscholar.org/paper/a3c736e333df2947e4523b98e0db57df8ab96bf5

Mathematics Subject Classification ID

Model-theoretic algebra (03C60) Generators, relations, and presentations of groups (20F05) Descriptive set theory (03E15) Model theory of denumerable and separable structures (03C15)

Related Items (26)

The classification problem for torsion-free abelian groups of finite rank ⋮ LOCALLY NORMAL SUBGROUPS OF TOTALLY DISCONNECTED GROUPS. PART II: COMPACTLY GENERATED SIMPLE GROUPS ⋮ On the concept of ``largeness in group theory. ⋮ COUNTABLE BOREL EQUIVALENCE RELATIONS ⋮ Complete analytic equivalence relations ⋮ JSL volume 79 issue 2 Cover and Back matter ⋮ Quotients by countable normal subgroups are hyperfinite ⋮ Rotation equivalence and cocycle superrigidity ⋮ Uncountable structures are not classifiable up to bi-embeddability ⋮ The Friedman embedding theorem. ⋮ Homology of holomorphs of free groups. ⋮ A topological zero-one law and elementary equivalence of finitely generated groups ⋮ Cayley graphs of finitely generated groups ⋮ Topological full groups of minimal subshifts and the classification problem for finitely generated complete groups ⋮ A Descriptive View of Combinatorial Group Theory ⋮ Isomorphism of finitely generated solvable groups is weakly universal. ⋮ On the complexity of the isomorphism relation for fields of finite transcendence degree ⋮ On the Complexity of the Classification Problem for Torsion-Free Abelian Groups of Finite Rank ⋮ Decomposing locally compact groups into simple pieces ⋮ Kaleidoscopic groups: permutation groups constructed from dendrite homeomorphisms ⋮ On the complexity of the classification problem for torsion-free abelian groups of rank two. ⋮ A remark on the Higman–Neumann–Neumann embedding theorem ⋮ The commensurability relation for finitely generated groups ⋮ Continuous versus Borel reductions ⋮ Canonical Ramsey Theory on Polish Spaces (Encyclopedia of Mathematics and its Applications 202) By Vladimir Kanovei, Marcin Sabok and Jindřich Zapletal ⋮ Uniformity, universality, and computability theory

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stabilizers for ergodic actions of higher rank semisimple groups
• A Borel reductibility theory for classes of countable structures
• Countable sections for locally compact group actions
• Observations on group rings
• Ergodic Equivalence Relations, Cohomology, and Von Neumann Algebras. I
• The Structure of Hyperfinite Borel Equivalence Relations
• COUNTABLE BOREL EQUIVALENCE RELATIONS
• The Free Product of Two Groups with a Malnormal Amalgamated Subgroup
• Borel equivalence relations and classifications of countable models

This page was built for publication: On the complexity of the isomorphism relation for finitely generated groups