Structurable equivalence relations
Abstract
For a class K of countable relational structures, a countable Borel equivalence relation E is said to be K-structurable if there is a Borel way to put a structure in K on each E-equivalence class. We study in this paper the global structure of the classes of K-structurable equivalence relations for various K. We show that K-structurability interacts well with several kinds of Borel homomorphisms and reductions commonly used in the classification of countable Borel equivalence relations. We consider the poset of classes of K-structurable equivalence relations for various K, under inclusion, and show that it is a distributive lattice; this implies that the Borel reducibility preordering among countable Borel equivalence relations contains a large sublattice. Finally, we consider the effect on K-structurability of various model-theoretic properties of K. In particular, we characterize the K such that every K-structurable equivalence relation is smooth, answering a question of Marks.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.