Timeline for Can there be no complexity bound on the definable elementary $V\rightarrow M$?
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 20, 2022 at 23:34 | comment | added | Noah Schweber | Odd follow-up question: what if we drop choice and allow arbitrary classes of ordinals as parameters when defining the $j$s? | |
| Aug 2, 2022 at 15:13 | comment | added | Gabe Goldberg | Since we are assuming there is no inner model with a proper class of measurable cardinals, one can use any of the constructions of the core model under this (or any weaker) anti-inner model assumption. So for example, the construction in Zeman's book "Inner models and large cardinals", or Mitchell's original "Core model for sequences of measures," or even Jensen-Steel's award-winning "K without the measurable" if we want to get fancy. I know the theorem that embeddings of V restrict to iterations of K from Steel's book "The core model iterability problem," the chapter on "Embeddings of K" | |
| Aug 2, 2022 at 12:31 | vote | accept | Noah Schweber | ||
| Aug 2, 2022 at 12:31 | comment | added | Noah Schweber | Thanks, this is great! Really outsider question, though: what exactly do you mean by "the core model $K$" here? I'm not entirely clear on the different kinds of core model out there. | |
| Aug 2, 2022 at 4:50 | history | answered | Gabe Goldberg | CC BY-SA 4.0 |