The complexity of the core model

Journal of Symbolic Logic 63 (4):1393-1398 (1998)
  Copy   BIBTEX


If there is no inner model with a cardinal κ such that o(κ) = κ ++ then the set K ∩ H ω 1 is definable over H ω 1 by a Δ 4 formula, and the set $\{J_\alpha[\mathscr{U}]: \alpha of countable initial segments of the core model K = L[U] is definable over H ω 1 by a Π 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 is not definable by any Σ 3 formula, and K ∩ H ω 1 is not definable by any boolean combination of Σ 3 formulas



    Upload a copy of this work     Papers currently archived: 77,670

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Spector forcing.J. M. Henle - 1984 - Journal of Symbolic Logic 49 (2):542-554.
The reals in core models.Philip Welch - 1987 - Journal of Symbolic Logic 52 (1):64-67.
Jónsson cardinals, erdös cardinals, and the core model.W. J. Mitchell - 1999 - Journal of Symbolic Logic 64 (3):1065-1086.
On elementary embeddings from an inner model to the universe.J. Vickers & P. D. Welch - 2001 - Journal of Symbolic Logic 66 (3):1090-1116.
The largest countable inductive set is a mouse set.Mitch Rudominer - 1999 - Journal of Symbolic Logic 64 (2):443-459.
On dedekind complete o-minimal structures.Anand Pillay & Charles Steinhorn - 1987 - Journal of Symbolic Logic 52 (1):156-164.
Extender based forcings.Moti Gitik & Menachem Magidor - 1994 - Journal of Symbolic Logic 59 (2):445-460.
Countable unions of simple sets in the core model.P. D. Welch - 1996 - Journal of Symbolic Logic 61 (1):293-312.


Added to PP

213 (#61,814)

6 months
1 (#480,066)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references