On the complexity of Borel equivalence relations with some countability property
DOI10.1090/tran/7942zbMath1480.03039arXiv1805.09167OpenAlexW2963349776WikidataQ127444881 ScholiaQ127444881MaRDI QIDQ5217885
Publication date: 26 February 2020
Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1805.09167
dichotomyBorel classBorel equivalence relationdescriptive complexitycontinuous reducibilityBorel reducibiity
Descriptive set theory (03E15) Classes of sets (Borel fields, (sigma)-rings, etc.), measurable sets, Suslin sets, analytic sets (28A05) Descriptive set theory (topological aspects of Borel, analytic, projective, etc. sets) (54H05)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Essential countability of treeable equivalence relations
- Descriptive set theory
- Borel liftings of Borel sets: some decidable and undecidable statements
- HOW CAN WE RECOGNIZE POTENTIALLY ${\bf\Pi}^{0}_{\xi}$ SUBSETS OF THE PLANE?
- Counting the number of equivalence classes of Borel and coanalytic equivalence relations
- Borel Classes and Closed Games: Wadge-Type and Hurewicz-Type Results
- A Glimm-Effros Dichotomy for Borel Equivalence Relations
- New Dichotomies for Borel Equivalence Relations
- Linear algebraic groups and countable Borel equivalence relations
- COUNTABLE BOREL EQUIVALENCE RELATIONS
- Potential Wadge classes
- A SEPARATION RESULT FOR COUNTABLE UNIONS OF BOREL RECTANGLES
- A dichotomy characterizing analytic digraphs of uncountable Borel chromatic number in any dimension
- Cofinal families of Borel equivalence relations and quasiorders
- A Separation Theorem for ∑ 1 1 Sets
This page was built for publication: On the complexity of Borel equivalence relations with some countability property