Abstract
We study the Baire class one countable colorings, i.e., the countable partitions into sets. Such a partition gives a covering of the diagonal into countably many squares. This leads to the study of countable unions of rectangles. We give a Hurewicz-like dichotomy for such countable unions.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.