Essential countability of treeable equivalence relations

DOI10.1016/j.aim.2014.07.035zbMath1354.03063arXiv1408.3801OpenAlexW2079722575WikidataQ56989313 ScholiaQ56989313MaRDI QIDQ406286

Dominique Lecomte, Benjamin D. Miller, John D. Clemens

Publication date: 8 September 2014

Published in: Advances in Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1408.3801

zbMATH Keywords

essentially countable equivalence relationdichotomy theoremessentially hyperfinite equivalence relationhypersmooth equivalence relation

Mathematics Subject Classification ID

Descriptive set theory (03E15) Classes of sets (Borel fields, (sigma)-rings, etc.), measurable sets, Suslin sets, analytic sets (28A05)

Related Items (4)

New jump operators on equivalence relations ⋮ Dichotomy theorems for families of non-cofinal essential complexity ⋮ Minimal definable graphs of definable chromatic number at least three ⋮ On the complexity of Borel equivalence relations with some countability property

Cites Work

• Unnamed Item
• Borel chromatic numbers
• Selection theorems and treeability
• Counting the number of equivalence classes of Borel and coanalytic equivalence relations
• A Glimm-Effros Dichotomy for Borel Equivalence Relations
• The Structure of Hyperfinite Borel Equivalence Relations
• The graph-theoretic approach to descriptive set theory
• The classification of hypersmooth Borel equivalence relations

This page was built for publication: Essential countability of treeable equivalence relations