Details

Autor(en) / Beteiligte

• KECHRIS, ALEXANDER S.
• NIES, ANDRÉ
• TENT, KATRIN

Titel

THE COMPLEXITY OF TOPOLOGICAL GROUP ISOMORPHISM

Ist Teil von

• The Journal of symbolic logic, 2018-09, Vol.83 (3), p.1190-1203

Ort / Verlag

Pasadena: Association for Symbolic Logic, Inc

Erscheinungsjahr

2018

Quelle

Alma/SFX Local Collection

Beschreibungen/Notizen

• We study the complexity of the topological isomorphism relation for various classes of closed subgroups of the group of permutations of the natural numbers. We use the setting of Borel reducibility between equivalence relations on Borel spaces. For profinite, locally compact, and Roelcke precompact groups, we show that the complexity is the same as the one of countable graph isomorphism. For oligomorphic groups, we merely establish this as an upper bound.