Conjugacy for homogeneous ordered graphs
Logic
2019-08-16 v1
Abstract
We show that for any countable homogeneous ordered graph , the conjugacy problem for automorphisms of is Borel complete. In fact we establish that each such satisfies a strong extension property called ABAP, which implies that the isomorphism relation on substructures of is Borel reducible to the conjugacy relation on automorphisms of .
Cite
@article{arxiv.1804.04609,
title = {Conjugacy for homogeneous ordered graphs},
author = {Samuel Coskey and Paul Ellis},
journal= {arXiv preprint arXiv:1804.04609},
year = {2019}
}