2000 character limit reached
A separation result for countable unions of Borel rectangles
Published 2 Aug 2017 in math.LO | (1708.00642v1)
Abstract: We provide dichotomy results characterizing when two disjoint analytic binary relations can be separated by a countable union of ${\bf\Sigma}0_1 !\times! {\bf\Sigma}0_\xi$ sets, or by a ${\bf\Pi}0_1 !\times! {\bf\Pi}0_\xi$ set.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.