Baire class one colorings and a dichotomy for countable unions of rectangles
arXiv:1004.2172
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.