For ${b \in {^{\omega}}{\omega}}$ , let ${\mathfrak{c}^{\exists}_{b, 1}}$ be the minimal number of functions (or slaloms with width 1) to catch every functions below b in infinitely many positions. In this paper, by using the technique of forcing, we construct a generic model in which there are many coefficients ${\mathfrak{c}^{\exists}_{{b_\alpha}, 1}}$ with pairwise different values. In particular, under the assumption that a weakly inaccessible cardinal exists, we can construct a generic model in which there are continuum many coefficients ${\mathfrak{c}^{\exists}_{{b_\alpha}, 1}}$ (...) with pairwise different values. In conjunction with these results, we give a generic model in which there are many Yorioka’s ideals ${\mathcal{I}_{f_\alpha}}$ with pairwise different covering numbers. (shrink)

Using GCH, we force the following: There are continuum many simple cardinal characteristics with pairwise different values.

For f, g $ \in \omega ^\omega $ let $c_{f,g}^\forall $ be the minimal number of uniform g-splitting trees (or: Slaloms) to cover the uniform f-splitting tree, i.e., for every branch v of the f-tree, one of the g-trees contains v. $c_{f,g}^\exists $ is the dual notion: For every branch v, one of the g-trees guesses v(m) infinitely often. It is consistent that $c_{f \in ,g \in }^\exists = c_{f \in ,g \in }^\forall = k_ \in $ for N₁ many (...) pairwise different cardinals $k_ \in $ and suitable pairs $(f_{ \in ,g \in } ).$ For the proof we use creatures with sufficient bigness and halving. We show that the lim-inf creature forcing satisfies fusion and pure decision. We introduce decisiveness and use it to construct a variant of the countable support iteration of such forcings, which still satisfies fusion and pure decision. (shrink)

For \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${f,g\in\omega^\omega}$$\end{document} let \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${c^\forall_{f,g}}$$\end{document} be the minimal number of uniform g-splitting trees needed to cover the uniform f-splitting tree, i.e., for every branch ν of the f-tree, one of the g-trees contains ν. Let \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${c^\exists_{f,g}}$$\end{document} be the dual notion: For every branch ν, one of the g-trees guesses ν(m) infinitely often. We show that (...) it is consistent that \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${c^\exists_{f_\epsilon,g_\epsilon}{=}c^\forall_{f_\epsilon,g_\epsilon}{=}\kappa_\e psilon}$$\end{document} for continuum many pairwise different cardinals \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\kappa_\epsilon}$$\end{document} and suitable pairs \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${(f_\epsilon,g_\epsilon)}$$\end{document}. For the proof we introduce a new mixed-limit creature forcing construction. (shrink)

We study the possible values of the cofinality invariant for various Borel ideals on the natural numbers. We introduce the notions of a fragmented and gradually fragmented ideal and prove a dichotomy for fragmented ideals. We show that every gradually fragmented ideal has cofinality consistently strictly smaller than the cardinal invariant and produce a model where there are uncountably many pairwise distinct cofinalities of gradually fragmented ideals.

We investigate the behavior of cardinal characteristics of the reals under extensions that do not add new [Formula: see text]-sequences (for some regular [Formula: see text]). As an application, we show that consistently the following cardinal characteristics can be different: The (“independent”) characteristics in Cichoń’s diagram, plus [Formula: see text]. (So we get thirteen different values, including [Formula: see text] and continuum). We also give constructions to alternatively separate other MA-numbers (instead of [Formula: see text]), namely: MA for [Formula: see (...) text]-Knaster from MA for [Formula: see text]-Knaster; and MA for the union of all [Formula: see text]-Knaster forcings from MA for precaliber. (shrink)

We investigate the behavior of cardinal characteristics of the reals under extensions that do not add new <κ-sequences. As an application, we show that consistently the followi...

We reimplement the creature forcing construction used by Fischer et al. :1045–1103, 2017. https://doi.org/10.1007/S00153-017-0553-8. arXiv:1402.0367 [math.LO]) to separate Cichoń’s diagram into five cardinals as a countable support product. Using the fact that it is of countable support, we augment our construction by adding uncountably many additional cardinal characteristics, sometimes referred to as localisation cardinals.

We investigate the Ramsey theory of continuous graph-structures on complete, separable metric spaces and apply the results to the problem of covering a plane by functions. Let the homogeneity number[Formula: see text] of a pair-coloring c:[X]2→2 be the number of c-homogeneous subsets of X needed to cover X. We isolate two continuous pair-colorings on the Cantor space 2ω, c min and c max, which satisfy [Formula: see text] and prove: Theorem. For every Polish space X and every continuous pair-coloringc:[X]2→2with[Formula: see (...) text], [Formula: see text] There is a model of set theory in which[Formula: see text]and[Formula: see text]. The consistency of [Formula: see text] and of [Formula: see text] follows from [20]. We prove that [Formula: see text] is equal to the covering number of 2 by graphs of Lipschitz functions and their reflections on the diagonal. An iteration of an optimal forcing notion associated to c min gives: Theorem. There is a model of set theory in which ℝ2 is coverable byℵ1graphs and reflections of graphs of continuous real functions; ℝ2 is not coverable byℵ1graphs and reflections of graphs of Lipschitz real functions. Figure 1.1 in the introduction summarizes the ZFC results in Part I of the paper. The independence results in Part II show that any two rows in Fig. 1.1 can be separated if one excludes [Formula: see text] from row. (shrink)

We show that certain type of tree forcings, including Sacks forcing, increases the covering of the strong measure zero ideal \. As a consequence, in Sacks model, such covering number is equal to the size of the continuum, which indicates that this covering number is consistently larger than any other classical cardinal invariant of the continuum. Even more, Sacks forcing can be used to force that \<\mathrm {cov}<\mathrm {cof}\), which is the first consistency result where more than two cardinal invariants (...) associated with \ are pairwise different. Another consequence is that \ in ZFC where \ denotes Marczewski’s ideal. (shrink)

Say that a function π:n<ω→n (henceforth called a predictor) k-constantly predicts a real xnω if for almost all intervals I of length k, there is iI such that x(i)=π(x↾i). We study the k-constant prediction number vnconst(k), 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 it is consistent with MA + ¬CH that the Forcing Axiom fails for all forcing notions in the class of ωω–bounding forcing notions with norms of [17].

In this paper we present two consistency results concerning the existence of large strong measure zero and strongly meager sets. RID=""ID="" Mathematics Subject Classification (2000): 03e35 RID=""ID="" The first author was supported by Alexander von Humboldt Foundation and NSF grant DMS 95-05375. The second author was partially supported by Basic Research Fund, Israel Academy of Sciences, publication 658.