UPDF AI

There may be exactly nn QQ-points

L. Halbeisen,Silvan Horvath,Tan Ozalp

2025 · ArXiv: 2507.15123
引用数 0

摘要

We generalize the main result of arXiv:2505.17960 and show the consistency of the statement ``There are exactly nn QQ-points up to isomorphism"for any finite nn. Furthermore, we show that the above statement for n=2n=2 can alternatively be obtained by a length-ω2\omega_2 countable support iteration of Matet-Mathias forcing restricted to a Matet-adequate family.