2000 character limit reached
Borel sets without perfectly many overlapping translations, II
Published 3 Sep 2019 in math.LO | (1909.00937v3)
Abstract: For a countable ordinal epsilon we construct a Sigma0_2 subset of the Cantor space for which one may force aleph_epsilon translations with intersections of size 2i, but such that it has no perfect set of such translations in any ccc extension. These sets have uncountably many translations with intersections of size 2i in ZFC, so this answers Problem 3.4 of arxiv:1711.04058 .
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.
