Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
121 tokens/sec
GPT-4o
9 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Structurable equivalence relations (1606.01995v5)

Published 7 Jun 2016 in math.LO

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

Summary

We haven't generated a summary for this paper yet.