A separation result for countable unions of Borel rectangles
From MaRDI portal
(Redirected from Publication:5222522)
Abstract: We provide dichotomy results characterizing when two disjoint analytic binary relations can be separated by a countable union of sets, or by a set.
Recommendations
Cites work
- A dichotomy characterizing analytic digraphs of uncountable Borel chromatic number in any dimension
- A Glimm-Effros Dichotomy for Borel Equivalence Relations
- A Separation Theorem for ∑ 1 1 Sets
- Baire-class colorings: the first three levels
- Borel chromatic numbers
- Borel Classes and Closed Games: Wadge-Type and Hurewicz-Type Results
- Borel liftings of Borel sets: some decidable and undecidable statements
- Descriptive set theory
- How can we recognize potentially ^0_ subsets of the plane?
- scientific article; zbMATH DE number 722611 (Why is no real title available?)
- On minimal non-potentially closed subsets of the plane
- Potential Wadge classes
- Separation of analytic sets by rectangles of low complexity
- The graph-theoretic approach to descriptive set theory
Cited in
(3)
This page was built for publication: A separation result for countable unions of Borel rectangles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5222522)