2000 character limit reached
Failure of Approachability at the Successor of the first Singular for any Cofinality
Published 24 Mar 2025 in math.LO | (2503.18898v1)
Abstract: We solve two long-standing open problems regarding the combinatorics of $\aleph_{\omega+1}$. We answer a question of Shelah by showing that it is consistent for any $n\geq 1$ that $\mathsf{GCH}$ holds and there is a stationary set of points of cofinality $\aleph_n$ which is not in the approachability ideal. As a corollary, we obtain a model where the notions of goodness and approachability are distinct for stationarily many points of cofinality $\aleph_1$, answering an open question of Cummings, Foreman, and Magidor.
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.