2000 character limit reached
There may be exactly $n$ $Q$-points
Published 20 Jul 2025 in math.LO | (2507.15123v1)
Abstract: We generalize the main result of arXiv:2505.17960 and show the consistency of the statement ``There are exactly $n$ $Q$-points up to isomorphism" for any finite $n$. Furthermore, we show that the above statement for $n=2$ can alternatively be obtained by a length-$\omega_2$ countable support iteration of Matet-Mathias forcing restricted to a Matet-adequate family.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.