The Complexity of the Core Model
Mitchell, William J.
J. Symbolic Logic, Tome 63 (1998) no. 1, p. 1393-1398 / Harvested from Project Euclid
If there is no inner model with a cardinal $\kappa$ such that $o(\kappa) = \kappa^{++}$ then the set $K \cap H_{\omega_1}$ is definable over H$_{\omega_1}$ by a $\Delta_4$ formula, and the set $\{J_\alpha[\mathscr{U}] : \alpha < \omega_1\}$ of countable initial segments of the core model $K = L[\mathscr{U}]$ is definable over $H_{\omega_1}$ by a $\Pi_3$ formula. We show that if there is an inner model with infinitely many measurable cardinals then there is a model in which $\{J_\alpha [\mathscr{U}] : \alpha < \omega_1\}$ is not definable by any $\Sigma_3$ formula, and $K \cap H_{\omega_1}$ is not definable by any boolean combination of $\Sigma_3$ formulas.
Publié le : 1998-12-14
Classification: 
@article{1183745637,
     author = {Mitchell, William J.},
     title = {The Complexity of the Core Model},
     journal = {J. Symbolic Logic},
     volume = {63},
     number = {1},
     year = {1998},
     pages = { 1393-1398},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183745637}
}
Mitchell, William J. The Complexity of the Core Model. J. Symbolic Logic, Tome 63 (1998) no. 1, pp.  1393-1398. http://gdmltest.u-ga.fr/item/1183745637/