Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-16T22:40:23.307Z Has data issue: false hasContentIssue false

The self-iterability of L[E]

Published online by Cambridge University Press:  12 March 2014

Ralf Schindler
Affiliation:
Institut für Mathematische Logik und Grundlagenforschung, Universität Münster, Einsteinstr. 62, 48149 Münster, Germany, E-mail: rds@uni-muenster.de
John Steel
Affiliation:
Department of Mathematics, 717 Evans Hall, University of California, Berkeley, Ca 94720, USA, E-mail: steel@math.berkeley.edu

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 κ which is not a limit of Woodin cardinals there is some cutpoint t < κ such that Jκ[E] is iterable above t with respect to iteration trees of length less than κ.

As an application we show L[E] to be a model of the following two cardinals versions of the diamond principle. If λ > κ > ω1 are cardinals, then holds true, and if in addition λ is regular, then holds true.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2009

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable