Let κ < λ be regular uncountable cardinals. Using a finite support iteration (in fact a matrix iteration) of ccc posets we obtain the consistency of b = a = κ < s = λ. If μ is a measurable cardinal and μ < κ < λ, then using similar techniques we obtain the consistency of b = κ < a = s = λ.

We introduce the property “F-linked” of subsets of posets for a given free filter F on the natural numbers, and define the properties “μ-F-linked” and “θ-F-Knaster” for posets in a natural way. We show that θ-F-Knaster posets preserve strong types of unbounded families and of maximal almost disjoint families. Concerning iterations of such posets, we develop a general technique to construct θ-Fr-Knaster posets (where Fr is the Frechet ideal) via matrix iterations of <θ-ultrafilter-linked posets (restricted to some level of the (...) matrix). This is applied to prove consistency results about Cichoń's diagram (without using large cardinals) and to prove the consistency of the fact that, for each Yorioka ideal, the four cardinal invariants associated with it are pairwise different. At the end, we show that three strongly compact cardinals are enough to force that Cichoń's diagram can be separated into 10 different values. (shrink)

We give characterizations for the sentences "Every $\Sigma^1_2$-set is measurable" and "Every $\Delta^1_2$-set is measurable" for various notions of measurability derived from well-known forcing partial orderings.

We show the consistency of ${\frak o} <{\frak d}$ where ${\frak o}$ is the size of the smallest off-branch family, and ${\frak d}$ is as usual the dominating number. We also prove the consistency of ${\frak b} < {\frak a}$ with large continuum. Here, ${\frak b}$ is the unbounding number, and ${\frak a}$ is the almost disjointness number.

It is relatively consistent with ZFC that every countable $FU_{fin} $ space of weight N₁ is metrizable. This provides a partial answer to a question of G. Gruenhage and P. Szeptycki [GS1].

We investigate some aspects of bounding, splitting, and almost disjointness. In particular, we investigate the relationship between the bounding number, the closed almost disjointness number, the splitting number, and the existence of certain kinds of splitting families.

Let A[ω]ω be a maximal almost disjoint family and assume P is a forcing notion. Say A is P-indestructible if A is still maximal in any P-generic extension. We investigate P-indestructibility for several classical forcing notions P. In particular, we provide a combinatorial characterization of P-indestructibility and, assuming a fragment of MA, we construct maximal almost disjoint families which are P-indestructible yet Q-destructible for several pairs of forcing notions . We close with a detailed investigation of iterated Sacks indestructibility.

Brendle, J., H. Judah and S. Shelah, Combinatorial properties of Hechler forcing, Annals of Pure and Applied Logic 59 185–199. Using a notion of rank for Hechler forcing we show: assuming ωV1 = ωL1, there is no real in V[d] which is eventually different from the reals in L[ d], where d is Hechler over V; adding one Hechler real makes the invariants on the left-hand side of Cichoń's diagram equal ω1 and those on the right-hand side equal 2ω and (...) produces a maximal almost disjoint family of subsets of ω of size ω1; there is no perfect set of random reals over V in V[ r][ d], where r is random over V and d Hechler over V[r], thus answering a question of the first and second authors. (shrink)

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 investigate which filters onωcan contain towers, that is, a modulo finite descending sequence without any pseudointersection. We prove the following results:Many classical examples of nice tall filters contain no towers.It is consistent that tall analytic P-filters contain towers of arbitrary regular height.It is consistent that all towers generate nonmeager filters, in particular Borel filters do not contain towers.The statement “Every ultrafilter contains towers.” is independent of ZFC.Furthermore, we study many possible logical implications between the existence of towers in filters, (...) inequalities between cardinal invariants of filters $,${\rm{co}}{{\rm{f}}^{\rm{*}}}\left$,${\rm{no}}{{\rm{n}}^{\rm{*}}}\left$, and${\rm{co}}{{\rm{v}}^{\rm{*}}}\left$), and the existence of Luzin type families, that is, if${\cal F}$is a filter then${\cal X} \subseteq {[\omega ]^\omega }$is an${\cal F}$-Luzin family if$\left\{ {X \in {\cal X}:|X \setminus F| = \omega } \right\}$is countable for every$F \in {\cal F}$. (shrink)

We show that Σ1 4-Amoeba-absoluteness implies that $\forall a \in \mathbb{R}(\omega^{L\lbrack a \rbrack}_1 < \omega^V_1)$ and, hence, Σ1 3-measurability. This answers a question of Haim Judah (private communication).

We show that g ≤ c(Sym(ω)) where g is the groupwise density number and c(Sym(ω)) is the cofinality of the infinite symmetric group. This solves (the second half of) a problem addressed by Thomas.

We investigate cardinal invariants related to the structure of dense sets of rationals modulo the nowhere dense sets. We prove that , thus dualizing the already known [B. Balcar, F. Hernández-Hernández, M. Hrušák, Combinatorics of dense subsets of the rationals, Fund. Math. 183 59–80, Theorem 3.6]. We also show the consistency of each of and . Our results answer four questions of Balcar, Hernández and Hrušák [B. Balcar, F. Hernández-Hernández, M. Hrušák, Combinatorics of dense subsets of the rationals, Fund. Math. (...) 183 59–80, Questions 3.11]. (shrink)

We prove that in many situations it is consistent with ZFC that part of the invariants involved in Cichon's diagram are equal to $\kappa$ while the others are equal to $\lambda$, where $\kappa < \lambda$ are both arbitrary regular uncountable cardinals. We extend some of these results to the case when $\lambda$ is singular. We also show that $\mathrm{cf}) < \kappa_A$ is consistent with ZFC.

We investigate the effect of adding a single real on cardinal invariants associated with the continuum. We show:1. adding an eventually different or a localization real adjoins a Luzin set of size continuum and a mad family of size ω1;2. Laver and Mathias forcing collapse the dominating number to ω1, and thus two Laver or Mathias reals added iteratively always force CH;3. Miller's rational perfect set forcing preserves the axiom MA.

We prove that in many situations it is consistent with ZFC that part of the invariants involved in Cichon's diagram are equal to κ while the others are equal to λ, where $\kappa < \lambda$ are both arbitrary regular uncountable cardinals. We extend some of these results to the case when λ is singular. We also show that $\mathrm{cf}(\kappa_U(\mathscr{L})) < \kappa_A(\mathscr{M})$ is consistent with ZFC.

We explore the connection between combinatorial principles on uncountable cardinals, like stick and club, on the one hand, and the combinatorics of sets of reals and, in particular, cardinal invariants of the continuum, on the other hand. For example, we prove that additivity of measure implies that Martin’s axiom holds for any Cohen algebra. We construct a model in which club holds, yet the covering number of the null ideal is large. We show that for uncountable cardinals κ≤λ and , (...) if all subsets of λ either contain, or are disjoint from, a member of , then has size at least etc. As an application, we solve the Gross space problem under by showing that there is such a space over any countable field. In two appendices, we solve problems of Fuchino, Shelah and Soukup, and of Kraszewski, respectively. (shrink)

We show that it is consistent that Martin's axiom holds, the continuum is large, and yet the dual distributivity number ℌ is κ1. This answers a question of Halbeisen.

We investigate the set (ω) of partitions of the natural numbers ordered by ≤* where A ≤* B if by gluing finitely many blocks of A we can get a partition coarser than B. In particular, we determine the values of a number of cardinals which are naturally associated with the structure ((ω),≥*), in terms of classical cardinal invariants of the continuum.

We study some properties of the quotient forcing notions ${Q_{tr(I)} = \wp(2^{< \omega})/tr(I)}$ and P I = B(2 ω )/I in two special cases: when I is the σ-ideal of meager sets or the σ-ideal of null sets on 2 ω . We show that the remainder forcing R I = Q tr(I)/P I is σ-closed in these cases. We also study the cardinal invariant of the continuum ${\mathfrak{h}_{\mathbb{Q}}}$ , the distributivity number of the quotient ${Dense(\mathbb{Q})/nwd}$ , in order to (...) show that ${\wp(\mathbb{Q})/nwd}$ collapses ${\mathfrak{c}}$ to ${\mathfrak{h}_{\mathbb{Q}}}$ , thus answering a question addressed in Balcar et al. (Fundamenta Mathematicae 183:59–80, 2004). (shrink)

LetG be a group. CallG akC-group if every element ofG has less thank conjugates. Denote byP(G) the least cardinalk such that any subset ofG of sizek contains two elements which commute.It is shown that the existence of groupsG such thatP(G) is a singular cardinal is consistent withZFC. So is the existence of groupsG which are notkC but haveP(G) (...) questions, and improves results, of Faber, Laver and McKenzie. (shrink)

We consider several game versions of the cardinal invariants \, \ and \. We show that the standard proof that parametrized diamond principles prove that the cardinal invariants are small actually shows that their game counterparts are small. On the other hand we show that \ and \ are both relatively consistent with ZFC, where \ and \ are the principal game versions of \ and \, respectively. The corresponding question for \ remains open.

. Say that a function π:n<ω→n k-constantly predicts a real xnω if for almost all intervals I of length k, there is iI such that x=π. We study the k-constant prediction number vnconst, that is, the size of the least family of predictors needed to k-constantly predict all reals, for different values of n and k, and investigate their relationship.

We show that, consistently, there can be maximal subtrees of \\) and \ / {\mathrm {fin}}\) of arbitrary regular uncountable size below the size of the continuum \. We also show that there are no maximal subtrees of \ / {\mathrm {fin}}\) with countable levels. Our results answer several questions of Campero-Arena et al..