On p-like equivalence relations
Abstract
For f [0,1] +, consider the relation Ef on [0,1]ω defined by (xn) Ef (yn) Σn < ω f(|yn - xn|) < ∞. We study the Borel reducibility of Borel equivalence relations of the form Ef. Our results indicate that for every 1 ≤ p < q < ∞, the order ≤B of Borel reducibility on the set of equivalence relations \ p ≤B ≤B q\ is more complicated than expected, e.g. consistently every linear order of cardinality continuum embeds into it.
0
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.