Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
157 tokens/sec
GPT-4o
8 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Borel sets without perfectly many overlapping translations, III (2009.03471v2)

Published 8 Sep 2020 in math.LO

Abstract: We expand the results of Roslanowski and Shelah arXive:1806.06283 , arXive:1909.00937 to all perfect Abelian Polish groups $(H,+)$. In particular, we show that if $\alpha<\omega_1$ and $4\leq k<\omega$, then there is a ccc forcing notion adding a $\Sigma0_2$ set $B\subseteq H$ which has $\aleph_\alpha$ many pairwise $k$--overlapping translations but not a perfect set of such translations.

Summary

We haven't generated a summary for this paper yet.