On unfoldable cardinals, ω-closed cardinals, and the beginning of the inner model hierarchy

Archive for Mathematical Logic 43 (4):443-458 (2004)
  Copy   BIBTEX

Abstract

Let κ be a cardinal, and let H κ be the class of sets of hereditary cardinality less than κ ; let τ (κ) > κ be the height of the smallest transitive admissible set containing every element of {κ}∪H κ . We show that a ZFC-definable notion of long unfoldability, a generalisation of weak compactness, implies in the core model K, that the mouse order restricted to H κ is as long as τ. (It is known that some weak large cardinal property is necessary for the latter to hold.) In other terms we delimit its strength as follows: Theorem Con(ZFC+ω2-Π 1 1-Determinacy) ⇒ ⇒Con(ZFC+V=K+∃ a long unfoldable cardinal ⇒ ⇒Con(ZFC+∀X(X # exists) + ‘‘ $\forall D \subseteq \omega_1 D$ is universally Baire ⇔ ∃r∈R(D∈L(r)))’’, and this is set-generically absolute). We isolate a notion of ω-closed cardinal which is weaker than an ω1-Erd\ os cardinal, and show that this bounds the first long unfoldable: Theorem Let κ be ω -closed. Then there is a long unfoldable ł<κ

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,349

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

Strongly unfoldable cardinals made indestructible.Thomas A. Johnstone - 2008 - Journal of Symbolic Logic 73 (4):1215-1248.
Chains of end elementary extensions of models of set theory.Andrés Villaveces - 1998 - Journal of Symbolic Logic 63 (3):1116-1136.
Unfoldable cardinals and the GCH.Joel David Hamkins - 2001 - Journal of Symbolic Logic 66 (3):1186-1198.
C(n)-cardinals.Joan Bagaria - 2012 - Archive for Mathematical Logic 51 (3-4):213-240.
On the indestructibility aspects of identity crisis.Grigor Sargsyan - 2009 - Archive for Mathematical Logic 48 (6):493-513.
Gap forcing: Generalizing the lévy-Solovay theorem.Joel David Hamkins - 1999 - Bulletin of Symbolic Logic 5 (2):264-272.
Easton’s theorem in the presence of Woodin cardinals.Brent Cody - 2013 - Archive for Mathematical Logic 52 (5-6):569-591.
The largest countable inductive set is a mouse set.Mitch Rudominer - 1999 - Journal of Symbolic Logic 64 (2):443-459.
Ramsey-like cardinals.Victoria Gitman - 2011 - Journal of Symbolic Logic 76 (2):519 - 540.
Making all cardinals almost Ramsey.Arthur W. Apter & Peter Koepke - 2008 - Archive for Mathematical Logic 47 (7-8):769-783.
Proper forcing and remarkable cardinals II.Ralf-Dieter Schindler - 2001 - Journal of Symbolic Logic 66 (3):1481-1492.

Analytics

Added to PP
2013-11-23

Downloads
29 (#535,100)

6 months
6 (#522,885)

Historical graph of downloads
How can I increase my downloads?

References found in this work

Set Theory.T. Jech - 2005 - Bulletin of Symbolic Logic 11 (2):243-245.
Generalized erdoös cardinals and O4.James E. Baumgartner & Fred Galvin - 1978 - Annals of Mathematical Logic 15 (3):289-313.
Countable unions of simple sets in the core model.P. D. Welch - 1996 - Journal of Symbolic Logic 61 (1):293-312.
Unfoldable Cardinals and the GCH.Joel Hamkins - 2001 - Journal of Symbolic Logic 66 (3):1186-1198.

View all 7 references / Add more references