paper

Structurable equivalence relations

arXiv:1606.01995

Abstract

For a class of countable relational structures, a countable Borel equivalence relation is said to be -structurable if there is a Borel way to put a structure in on each -equivalence class. We study in this paper the global structure of the classes of -structurable equivalence relations for various . We show that -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 -structurable equivalence relations for various , 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 -structurability of various model-theoretic properties of . In particular, we characterize the such that every -structurable equivalence relation is smooth, answering a question of Marks.

arXiv comment77 pages; answered Remark 5.28 (Problem 9.2)