On the complexity of the isomorphism relation for finitely generated groups

37Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Confirming a conjecture of G. Hjorth and A. Kechris (1996, Ann. Pure Appl. Logic82, 221-272) we prove that the isomorphism relation for finitely generated groups is a universal essentially countable Borel equivalence relation. We also prove the corresponding result for the conjugacy relation for subgroups of the free group F2 on two generators. © 1999 Academic Press.

Cite

CITATION STYLE

APA

Thomas, S., & Velickovic, B. (1999). On the complexity of the isomorphism relation for finitely generated groups. Journal of Algebra, 217(1), 352–373. https://doi.org/10.1006/jabr.1998.7825

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free