• Corpus ID: 202540261

Borel sets without perfectly many overlapping translations, II

@inproceedings{Roslanowski2019BorelSW,
  title={Borel sets without perfectly many overlapping translations, II},
  author={Andrzej Roslanowski and Saharon Shelah},
  year={2019}
}
For a countable ordinal epsilon we construct a Sigma^0_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 . 
View PDF on arXiv
1 Citation
Background Citations
1
Methods Citations
1

One Citation

Borel sets without perfectly many overlapping translations

For a cardinal lambda<lambda_{omega_1} we give a ccc forcing notion P which forces that for some Borel subset B of the Cantor space (1) there a sequence (eta_alpha:alpha 5 for all…

25 References

Borel sets without perfectly many overlapping translations

For a cardinal lambda<lambda_{omega_1} we give a ccc forcing notion P which forces that for some Borel subset B of the Cantor space (1) there a sequence (eta_alpha:alpha 5 for all…

On Borel sets belonging to every invariant ccc -ideal on 2^{ℕ}

. Let I ccc be the σ -ideal of subsets of the Cantor group 2 N generated by Borel sets which belong to every translation-invariant σ -ideal on 2 N satisfying the countable chain condition (ccc). We…

A countable dense homogeneous set of reals of size ℵ

We prove there is a countable dense homogeneous subspace of R of size @1. The proof involves an absoluteness argument using an extension of the L!1!(Q) logic obtained by adding predicates for Borel…

Not so many non-disjoint translations

  • A. RoslanowskiV. Rykov
  • Mathematics, Computer Science
    Proceedings of the American Mathematical Society, Series B
  • 2018
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.

Decomposing the real line into Borel sets closed under addition

It is proved among others that the number of pieces is either at most 3 or uncountable, and it is shown that it is undecidable in and even in the theory if theNumber of pieces can be unccountable but less than the continuum.

Covering ℝ with translates of a compact set

Motivated by a question of Gruenhage, we investigate when R is the union of less than continuum many translates of a compact set C C R. It will follow from one of our general results that if a…

A Partition Calculus in Set Theory

Dedekind’s pigeon-hole principle, also known as the box argument or the chest of drawers argument (Schubfachprinzip) can be described, rather vaguely, as follows. If sufficiently many objects are…

Ideals without ccc

The aim of the paper is to study whether the reverse implications in the chain (D) ⇒ (M) ⊆ (B) ⇓ not-ccc can hold and whether some sharp version's of (M), an ideal of subsets of a Polish space X, for invariant ideals on Polish groups are investigated.

Analytic colorings

Borel sets with large squares

For a cardinal mu we give a sufficient condition (*)_mu (involving ranks measuring existence of independent sets) for: [(**)_mu] if a Borel set B subseteq R x R contains a mu-square (i.e. a set of…