<p>We generalize the main result of [<CitationRef CitationID="CR13">13</CitationRef>] and show the consistency of the statement “There are exactly <i>n</i> <i>Q</i>-points up to isomorphism" for any finite <i>n</i>. Furthermore, we show that the above statement for <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(n=2\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>n</mi> <mo>=</mo> <mn>2</mn> </mrow> </math></EquationSource> </InlineEquation> can alternatively be obtained by a length-<InlineEquation ID="IEq2"> <EquationSource Format="TEX">\(\omega _2\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>ω</mi> <mn>2</mn> </msub> </math></EquationSource> </InlineEquation> countable support iteration of Matet-Mathias forcing restricted to a Matet-adequate family.</p>
We generalize the main result of [13] and show the consistency of the statement “There are exactly nQ-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.