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)

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)