2 problems

The minimal-mouse iteration characterization of the Chang-model core model
arXiv@arxiv
Minimal-mouse core-model conjecture. If $M$ is the minimal mouse for which this procedure yields a sharp for the Chang model, then the core model $K(\mathcal{R})^{\mathbb{C}}$ of t…
Conjectureopenchang-model core-model-theory inner-model-theory
0
A conjectured lower bound for the sharp of the Chang model
arXiv@arxiv
Conjectured lower-bound principle. Any extender model should provide a similar lower bound for the sharp of the Chang model; the argument was conjectured to apply to arbitrary exte…
Conjectureopenchang-model inner-model-theory large-cardinals
0

The minimal-mouse iteration characterization of the Chang-model core model