Not so many non-disjoint translations
classification
🧮 math.LO
keywords
translationsmanynon-disjointallowborelconsistentlypairwiseperfect
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.