2000 character limit reached
Successive failures of approachability
Published 16 Feb 2017 in math.LO | (1702.05062v2)
Abstract: Motivated by showing that in ZFC we cannot construct a special Aronszajn tree on some cardinal greater than $\aleph_1$, we produce a model in which the approachability property fails (hence there are no special Aronszajn trees) at all regular cardinals in the interval $[\aleph_2, \aleph_{\omega2+3}]$ and $\aleph_{\omega2}$ is strong limit.
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.