Walks along a weak square sequence and the non-semiproperness of Namba forcings
Abstract
In this paper, we demonstrate that if, for every -complete fine filter F over Pλ, the associated Namba forcing Nm(,λ,F) is semiproper, then (μ,<1) fails for all regular μ ∈ [λ, 2λ] under the certain cardinal arithmetic. In particular, this result establishes that the consistency strength of the semiproperness of Nm(2,F) for every 2-complete filter F over 2 exceeds the strength of infinitely many Woodin cardinals. Minimal walk methods associated with a square sequece play a central role in this paper. These observations introduce two-cardinal walks with naive C-sequences and show that the existence of non-reflecting stationary subsets implies Pλ [Iλ+]3λ.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.