2000 character limit reached
Cascading Variants of Internal Approachability
Published 29 Apr 2024 in math.LO | (2404.18571v1)
Abstract: We construct models in which there are stationarily many structures that exhibit different variants of internal approachability at different levels. This answers a question of Foreman. We also show that the approachability property at $\mu$ is consistent with having a distinction of variants of internal approachability for stationarily many $N\in[H(\mu+)]{\mu}$. This is obtained using a new version of Mitchell Forcing.
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.