共查询到20条相似文献,搜索用时 15 毫秒
1.
2.
3.
4.
5.
7.
8.
9.
10.
11.
12.
《Annals of Pure and Applied Logic》2022,173(8):103135
We further develop a forcing notion known as Coding with Perfect Trees and show that this poset preserves, in a strong sense, definable P-points, definable tight MAD families and definable selective independent families. As a result, we obtain a model in which , each of , , has a witness and there is a well-order of the reals. Note that both the complexity of the witnesses of the above combinatorial cardinal characteristics, as well as the complexity of the well-order are optimal. In addition, we show that the existence of a well-order of the reals is consistent with and each of the following: , , , where the smaller cardinal characteristics have co-analytic witnesses.Our methods allow the preservation of only sufficiently definable witnesses, which significantly differs from other preservation results of this type. 相似文献
13.
14.
15.
19.