2000 character limit reached
Of Mice and Machetes
Published 31 Jul 2024 in math.LO | (2407.21562v1)
Abstract: Let $R$ be the class of regular cardinals which are not hyperinaccessible. We show that $L[R]$, and similar inner models in the $\alpha$-inaccessible hierarchy, can be generated by iterating a small "machete" mouse up through all the ordinals, and then taking a generic extension by a hyperclass Magidor iteration of Prikry forcings. We then show that such simple mice are themselves elements of $L[\mathsf{Reg}]$.
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.