
arXiv: 2202.12046
Generalizing the proof for Sacks forcing, we show that the $h$-perfect tree forcing notions introduced by Goldstern, Judah and Shelah preserve selective independent families even when iterated. As a result we obtain new proofs of the consistency of $\mathfrak{i} = \mathfrak{u} < \mathrm{non} (\mathcal N) = \mathrm{cof} (\mathcal N)$ and $\mathfrak{i} < \mathfrak{u} = \mathrm{non} (\mathcal N) = \mathrm{cof}( \mathcal N)$ as well as some related results.
11 pages, intended for publication in the RIMS Set Theory 2021 Workshop Kokyuroku
101013 Mathematical logic, 101013 Mathematische Logik, FOS: Mathematics, Mathematics - Logic, Logic (math.LO)
101013 Mathematical logic, 101013 Mathematische Logik, FOS: Mathematics, Mathematics - Logic, Logic (math.LO)
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
