Conjugacy for homogeneous ordered graphs

Archive for Mathematical Logic 58 (3-4):457-467 (2019)
  Copy   BIBTEX

Abstract

We show that for any countable homogeneous ordered graph G, the conjugacy problem for automorphisms of G is Borel complete. In fact we establish that each such G satisfies a strong extension property called ABAP, which implies that the isomorphism relation on substructures of G is Borel reducible to the conjugacy relation on automorphisms of G.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 107,826

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Hilbert spaces with generic groups of automorphisms.Alexander Berenstein - 2007 - Archive for Mathematical Logic 46 (3-4):289-299.
Isomorphism of Homogeneous Structures.John D. Clemens - 2009 - Notre Dame Journal of Formal Logic 50 (1):1-22.
On the non-existence of mad families.Haim Horowitz & Saharon Shelah - 2019 - Archive for Mathematical Logic 58 (3-4):325-338.
Weak Borel chromatic numbers.Stefan Geschke - 2011 - Mathematical Logic Quarterly 57 (1):5-13.
Non-genericity phenomena in ordered Fraïssé classes.Konstantin Slutsky - 2012 - Journal of Symbolic Logic 77 (3):987-1010.
Isomorphism of Locally Compact Polish Metric Structures.Maciej Malicki - 2024 - Journal of Symbolic Logic 89 (2):646-664.

Analytics

Added to PP
2018-09-09

Downloads
33 (#817,843)

6 months
7 (#816,203)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Model theory.Wilfrid Hodges - 2008 - Stanford Encyclopedia of Philosophy.

Add more references