Borel sets without perfectly many overlapping translations, III

Andrzej Rosłanowski*, Saharon Shelah

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

We expand the results of Rosłanowski and Shelah [11,10] to all perfect Abelian Polish groups (H,+). In particular, we show that if α<ω1 and 4≤k<ω, then there is a ccc forcing notion adding a Σ20 set B⊆H which has ℵα many pairwise k–overlapping translations but not a perfect set of such translations. The technicalities of the forcing construction led us to investigations of the question when, in an Abelian group, X−X⊆Y−Y imply that a translation of X or −X is included in Y.

Original languageEnglish
Article number103565
JournalAnnals of Pure and Applied Logic
Volume176
Issue number6
DOIs
StatePublished - Jun 2025

Bibliographical note

Publisher Copyright:
© 2025 Elsevier B.V.

Keywords

  • Abelian Polish groups
  • Borel sets
  • Forcing
  • Splitting rank

Fingerprint

Dive into the research topics of 'Borel sets without perfectly many overlapping translations, III'. Together they form a unique fingerprint.

Cite this