## Mad families, splitting families and large continuum.(English)Zbl 1215.03061

The authors study the bounding, the splitting and the almost disjointness numbers $$\mathfrak{b}$$, $${\mathfrak s}$$ and $$\mathfrak{a}$$. The bounding and the splitting numbers are independent. Baumgartner and Dordal obtained the consistency of $$\mathfrak{s} < \mathfrak{b}$$ and Shelah showed the consistency of $$\mathfrak{s} < \mathfrak{b}$$ using a proper forcing notion. Thus, it is of interest to obtain models in which $$2^{\aleph_0} \geq \aleph_3$$. Using finite support iteration of ccc posets, Brendle obtained the consistency of $$\mathfrak{b = \kappa < a = \kappa^+}$$, and Fischer and Steprāns obtained the consistency of $$\mathfrak{b = \kappa < s = \kappa^+}$$.
Here, the authors show the consistency of $$\mathfrak{b = a = \kappa < s = \lambda}$$, where $$\kappa < \lambda$$ are arbitrary regular uncountable cardinals. Further on, they show the consistency of $$\mathfrak{b = \kappa < a = s = \lambda}$$, where $$\kappa < \lambda$$ are arbitrary regular cardinals above a measurable cardinal $$\mu$$. The proofs are given by finite support iterations of ccc posets. The constructions use the idea of matrix iteration introduced by Blass and Shelah.

### MSC:

 3e+17 Cardinal characteristics of the continuum 3e+35 Consistency and independence results 3e+55 Large cardinals
Full Text:

### References:

 [1] DOI: 10.1007/s001530050091 · Zbl 0905.03034 [2] Israel Journal of Mathematics 65 pp 259– (1984) [3] Handbook of set theory 1 pp 395– (2010) [4] Adjoining dominating functions 50 pp 94– (1985) [5] DOI: 10.1016/0016-660X(72)90001-3 · Zbl 0246.02047 [6] DOI: 10.4064/fm201-3-5 · Zbl 1161.03029 [7] Acta Universitatis Carottnae. Mathematica et Physica 49 pp 19– (2007) [8] DOI: 10.1007/BF02392740 · Zbl 1106.03044 [9] Contemporary Mathematics 31 pp 184– (1984)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.