Article contents
THE COMPLEXITY OF TOPOLOGICAL GROUP ISOMORPHISM
Published online by Cambridge University Press: 23 October 2018
Abstract
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.
Keywords
- Type
- Articles
- Information
- Copyright
- Copyright © The Association for Symbolic Logic 2018
References
REFERENCES
- 7
- Cited by