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)

We investigate uncountable maximal antichains of perfect trees and of splitting trees. We show that in the case of perfect trees they must have size of at least the dominating number, whereas for splitting trees they are of size at least \\), i.e. the covering coefficient of the meager ideal. Finally, we show that uncountable maximal antichains of superperfect trees are at least of size the bounding number; moreover we show that this is best possible.

We show that every dominating analytic set in the Baire space has a dominating closed subset. This improves a theorem of Spinas [15] saying that every dominating analytic set contains the branches of a uniform tree, i.e. a superperfect tree with the property that for every splitnode all the successor splitnodes have the same length. In [15], a subset of the Baire space is called u-regular if either it is not dominating or it contains the branches of a uniform tree, (...) and it was proved that Σ21-Kσ-regularity implies Σ21-u-regularity. Here we show that these properties are in fact equivalent. Since the proof of analytic u-regularity uses a game argument it was clear that determinacy implies u-regularity of all sets. Here we show that an inaccessible cardinal is enough to construct a model for projective u-regularity, namely it holds in Solovay's model. Finally we show that forcing with uniform trees is equivalent to Laver forcing. (shrink)

We show that every analytic set in the Baire space which is dominating contains the branches of a uniform tree, i.e. a superperfect tree with the property that for every splitnode all the successor splitnodes have the same length. We call this property of analytic sets u-regularity. However, we show that the concept of uniform tree does not suffice to characterize dominating analytic sets in general. We construct a dominating closed set with the property that for no uniform tree whose (...) branches are contained in the closed set, the set of these branches is dominating. We also show that from a Σ1n+1-rapid filter a non-u-regular Π1n-set can be constructed. Finally, we prove that ∑12-Kσ-regularity implies ∑12-u-regularity. (shrink)

We continue [21] and study partition numbers of partial orderings which are related to /fin. In particular, we investigate Pf, be the suborder of /fin)ω containing only filtered elements, the Mathias partial order M, and , ω the lattice of partitions of ω, respectively. We show that Solomon's inequality holds for M and that it consistently fails for Pf. We show that the partition number of is C. We also show that consistently the distributivity number of ω is smaller than (...) the distributivity number of /fin. We also investigate partitions of a Polish space into closed sets. We show that such a partition either is countable or has size at least D, where D is the dominating number. We also show that the existence of a dominating family of size 1 does not imply that a Polish space can be partitioned into 1 many closed sets. (shrink)

A family A ⊆ ℘(ω) is called countably splitting if for every countable $F \subseteq [\omega]^{\omega}$ , some element of A splits every member of F. We define a notion of a splitting tree, by means of which we prove that every analytic countably splitting family contains a closed countably splitting family. An application of this notion solves a problem of Blass. On the other hand we show that there exists an $F_{\sigma}$ splitting family that does not contain a closed (...) splitting family. (shrink)

We prove that every analytic set in ω ω × ω ω with σ-bounded sections has a not σ-bounded closed free set. We show that this result is sharp. There exists a closed set with bounded sections which has no dominating analytic free set, and there exists a closed set with non-dominating sections which does not have a not σ-bounded analytic free set. Under projective determinacy analytic can be replaced in the above results by projective.

We prove that consistently the Lebesgue null ideal is not Tukey reducible to the Silver null ideal. This contrasts with the situation for the meager ideal which, by a recent result of the author, Spinas [Silver trees and Cohen reals, Israel J. Math. 211 473–480] is Tukey reducible to the Silver ideal.

We describe a list of canonical functions from 2 to ℝ such that every Borel measurable function from 2 to ℝ, on some superperfect rectangle, induces the same equivalence relation as some canonical function.

We investigate measure and category in the projective hierarchie in the presence of large cardinals. Assuming a measurable larger than $n$ Woodin cardinals we construct a model where every $\Delta ^1_{n+4}$ -set is measurable, but some $\Delta ^1_{n+4}$ -set does not have Baire property. Moreover, from the same assumption plus a precipitous ideal on $\omega _1$ we show how a model can be forced where every $\Sigma ^1_{n+4}-$ set is measurable and has Baire property.

Assuming that an inaccessible cardinal exists, we construct a ZFC-model where every Δ 1 4 -set is measurable but there exists a Δ 1 4 -set without the property of Baire. By a result of Shelah, an inaccessible cardinal is necessary for this result.

We investigate several versions of a cardinal characteristic $ \frak f$ defined by Frankiewicz. Vojtáš showed ${\frak b} \leq{\frak f}$ , and Blass showed ${\frak f} \leq \min({\frak d},{\mbox{\rm unif}}({\bf K}))$ . We show that all the versions coincide and that ${\frak f}$ is greater than or equal to the splitting number. We prove the consistency of $\max({\frak b},{\frak s}) <{\frak f}$ and of ${\frak f} < \min({\frak d},{\mbox{\rm unif}}({\bf K}))$.

Let ${{\mathcal J}\,(\mathbb M^2)}$ denote the σ-ideal associated with two-dimensional Miller forcing. We show that it is relatively consistent with ZFC that the additivity of ${{\mathcal J}\,(\mathbb M^2)}$ is bigger than the covering number of the ideal of the meager subsets of ω ω. We also show that Martin’s Axiom implies that the additivity of ${{\mathcal J}\,(\mathbb M^2)}$ is 2 ω .Finally we prove that there are no analytic infinite maximal antichains in any finite product of ${\mathfrak{P}{(\omega)}/{\rm fin}}$.

Two countable filters on ω are incompatible if they have no common infinite pseudointersection. Letting α(P f ) denote the minimal size of a maximal uncountable family of pairwise incompatible countable filters on ω, we prove the consistency of t $.

Two countable filters on $\omega$ are incompatible if they have no common infinite pseudointersection. Letting $\alpha(P_f)$ denote the minimal size of a maximal uncountable family of pairwise incompatible countable filters on $\omega$, we prove the consistency of t $< \alpha(P_f)$.