加载中…
In this paper, we demonstrate that if, for every -complete fine filter over , the associated Namba forcing is semiproper, then fails for all regular under the certain cardinal arithmetic. In particular, this result establishes that the consistency strength of the semiproperness of for every -complete filter over 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 -sequences and show that the existence of non-reflecting stationary subsets implies .

生成讲解博客的中文版本

生成AI智能校验的中文版本