The complexity of the core model
Journal of Symbolic Logic 63 (4):1393-1398 (1998)
Abstract
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 formulasAuthor's Profile
DOI
10.2307/2586656
My notes
Similar books and articles
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.
Uniqueness, collection, and external collapse of cardinals in ist and models of peano arithmetic.V. Kanovei - 1995 - Journal of Symbolic Logic 60 (1):318-324.
Automorphisms moving all non-algebraic points and an application to NF.Friederike Körner - 1998 - Journal of Symbolic Logic 63 (3):815-830.
Countable unions of simple sets in the core model.P. D. Welch - 1996 - Journal of Symbolic Logic 61 (1):293-312.
Analytics
Added to PP
2009-01-28
Downloads
213 (#59,797)
6 months
1 (#449,844)
2009-01-28
Downloads
213 (#59,797)
6 months
1 (#449,844)
Historical graph of downloads