Author:
KECHRIS ALEXANDER S.,NIES ANDRÉ,TENT KATRIN
Abstract
AbstractWe 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.
Publisher
Cambridge University Press (CUP)
Reference11 articles.
1. The Descriptive Set Theory of Polish Group Actions
2. Unitary Representations of Oligomorphic Groups
3. [10] Rosendal C. and Zielinski J. , Compact metrizable structures and classification problems, this JOURNAL, vol. 83 (2018), no. 1, pp. 165–186.
4. Classical Descriptive Set Theory
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献