2000 character limit reached
Not so many non-disjoint translations
Published 11 Nov 2017 in math.LO | (1711.04058v1)
Abstract: We show that, consistently, there is a Borel set which has uncountably many pairwise very non-disjoint translations, but does not allow a perfect set of such translations.
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.
