In this paper we investigate the structure of uncountable maximal antichains of Silver forcing and show that they have to be at least of size d, where d is the dominating number. Part of this work can be used to show that the additivity of the Silver forcing ideal has size at least the unbounding number b. It follows that every reasonable amoeba Silver forcing adds a dominating real.

Louveau, A., S. Shelah and B. Velikovi, Borel partitions of infinite subtrees of a perfect tree, Annals of Pure and Applied Logic 63 271–281. We define a notion of type of a perfect tree and show that, for any given type τ, if the set of all subtrees of a given perfect tree T which have type τ is partitioned into two Borel classes then there is a perfect subtree S of T such that all subtrees of S of type (...) τ belong to the same class. This result simultaneously generalizes the partition theorems of Galvin-Prikry and Galvin-Blass. The key ingredient of the proof is the theorem of Halpern-Laüchli on partitions of products of perfect trees. (shrink)

By $\mathfrak{B}_2$ we denote the $\sigma$-ideal of all subsets $A$ of the Cantor set $\{0,1\}^\omega$ such that for every infinite subset $T$ of $\omega$ the restriction $A\mid\{0,1\}^T$ is a proper subset of $\{0,1\}^T$. In this paper we investigate set theoretical properties of this and similar ideals.

In this paper we study the question assuming MA+⌝CH does Sacks forcing or Laver forcing collapse cardinals? We show that this question is equivalent to the question of what is the additivity of Marczewski's ideals 0. We give a proof that it is consistent that Sacks forcing collapses cardinals. On the other hand we show that Laver forcing does not collapse cardinals.

Louveau, A., S. Shelah and B. Velikovi, Borel partitions of infinite subtrees of a perfect tree, Annals of Pure and Applied Logic 63 271–281. We define a notion of type of a perfect tree and show that, for any given type τ, if the set of all subtrees of a given perfect tree T which have type τ is partitioned into two Borel classes then there is a perfect subtree S of T such that all subtrees of S of type (...) τ belong to the same class. This result simultaneously generalizes the partition theorems of Galvin-Prikry and Galvin-Blass. The key ingredient of the proof is the theorem of Halpern-Laüchli on partitions of products of perfect trees. (shrink)

We continue the investigation of the Laver ideal ℓ 0 and Miller ideal m 0 started in [GJSp] and [GRShSp]; these are the ideals on the Baire space associated with Laver forcing and Miller forcing. We solve several open problems from these papers. The main result is the construction of models for $t , where add denotes the additivity coefficient of an ideal. For this we construct amoeba forcings for these forcings which do not add Cohen reals. We show that (...) c = ω 2 implies $\operatorname{add}(m^0) \leq \mathfrak{h}$ . We show that b = c, d = c implies $\operatorname{cov}(\ell^0) \leq \mathfrak{h}^+, \operatorname{cov}(m^0) \leq \mathfrak{h}^+$ respectively. Here $\operatorname{cov}$ denotes the covering coefficient. We also show that in the Cohen model $\operatorname{cov}(m^0) holds. Finally we prove that Cohen forcing does not add a superperfect tree of Cohen reals. (shrink)

By B2 we denote the σ-ideal of all subsets A of the Cantor set {0,1}ω such that for every infinite subset T of ω the restriction A∣{0,1}T is a proper subset of {0,1}T. In this paper we investigate set theoretical properties of this and similar ideals.