Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Nies, Andree"'
Publikováno v:
J. Symbolic Logic, 2018
We study the complexity of the 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 Polish spaces. For profinite, l
Externí odkaz:
http://arxiv.org/abs/1705.08081