2000 character limit reached
On fresh sets in iterations of Prikry type forcing notions
Published 3 Mar 2024 in math.LO | (2403.01617v1)
Abstract: We examine the existence (and mostly non-existence) of fresh sets in commonly used iterations of Prikry type forcing notions. Results of [4] are generalized. As an application, a question of a referee of [9] is answered. In addition stationary sets preservation is addressed.
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.