A separation result for countable unions of Borel rectangles
From MaRDI portal
Publication:5222522
DOI10.1017/JSL.2019.13zbMATH Open1479.03019arXiv1708.00642OpenAlexW3105729805MaRDI QIDQ5222522FDOQ5222522
Authors: Dominique Lecomte
Publication date: 6 April 2020
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1708.00642
Recommendations
Descriptive set theory (03E15) Descriptive set theory (topological aspects of Borel, analytic, projective, etc. sets) (54H05)
Cites Work
- Title not available (Why is that?)
- Descriptive set theory
- A Glimm-Effros Dichotomy for Borel Equivalence Relations
- Borel chromatic numbers
- The graph-theoretic approach to descriptive set theory
- Borel Classes and Closed Games: Wadge-Type and Hurewicz-Type Results
- A dichotomy characterizing analytic digraphs of uncountable Borel chromatic number in any dimension
- On minimal non-potentially closed subsets of the plane
- Borel liftings of Borel sets: some decidable and undecidable statements
- A Separation Theorem for ∑ 1 1 Sets
- How can we recognize potentially \(\boldsymbol\Pi^0_\xi\) subsets of the plane?
- Potential Wadge classes
- Separation of analytic sets by rectangles of low complexity
- Baire-class \(\xi\) colorings: the first three levels
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)