A geometric iteration method is developed for generalised perfect set forcing P(F), enabling its iteration with ≤κ supports along well-founded partial orders while preserving cardinals ≤κ⁺.
Cardinal invariants above the continuum
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.LO 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
A forcing construction yields a chain of length ω₃ in [ω₁]^{ω₁} that is increasing modulo finite sets.
citing papers explorer
-
Iterating Generalised Perfect Set Forcing Along Well-Founded Orders
A geometric iteration method is developed for generalised perfect set forcing P(F), enabling its iteration with ≤κ supports along well-founded partial orders while preserving cardinals ≤κ⁺.
-
Long Strong Chains of Subsets of $\omega_1$
A forcing construction yields a chain of length ω₃ in [ω₁]^{ω₁} that is increasing modulo finite sets.