The self-iterability of L[E]

Journal of Symbolic Logic 74 (3):751-779 (2009)
  Copy   BIBTEX

Abstract

Let L[E] be an iterable tame extender model. We analyze to which extent L[E] knows fragments of its own iteration strategy. Specifically, we prove that inside L[E], for every cardinal K which is not a limit of Woodin cardinals there is some cutpoint t K > a>ω1 are cardinals, then ◊$_{K.\lambda }^* $ holds true, and if in addition λ is regular, then ◊$_{K.\lambda }^* $ holds true

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 103,486

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

Analytics

Added to PP
2010-09-12

Downloads
63 (#355,631)

6 months
7 (#519,682)

Historical graph of downloads
How can I increase my downloads?

Author Profiles

Jack Steel
University of Edinburgh

Citations of this work

Iterability for (transfinite) stacks.Farmer Schlutzenberg - 2021 - Journal of Mathematical Logic 21 (2):2150008.
The definability of E in self-iterable mice.Farmer Schlutzenberg - 2023 - Annals of Pure and Applied Logic 174 (2):103208.

View all 9 citations / Add more citations

References found in this work

The covering lemma up to a Woodin cardinal.W. J. Mitchell, E. Schimmerling & J. R. Steel - 1997 - Annals of Pure and Applied Logic 84 (2):219-255.

Add more references