The conjugacy problem for automorphism groups of countable homogeneous structures

Abstract

We consider the conjugacy problem for the automorphism groups of a number of countable homogeneous structures. In each case we find the precise complexity of the conjugacy relation in the sense of Borel reducibility.

References in corpus (3)

• Model theoretic forcing in analysis
• The conjugacy problem for the automorphism group of the random graph
• The isomorphism relation for separable C*-algebras

Cited by in corpus (2)

• Conjugacy for homogeneous ordered graphs
• The conjugacy problem for automorphism groups of homogeneous digraphs