Hostname: page-component-7dd5485656-glrdx Total loading time: 0 Render date: 2025-10-31T01:51:15.643Z Has data issue: false hasContentIssue false
  • English
  • Français

The self-iterability of L[E]

Published online by Cambridge University Press:  12 March 2014

Ralf Schindler  and
John Steel
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
Get access Rights & Permissions [Opens in a new window]

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
Information
The Journal of Symbolic Logic , Volume 74 , Issue 3 , September 2009 , pp. 751 - 779
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

References

REFERENCES

[1]Donder, D. and Matet, P., Two cardinal versions of diamond, Israel Journal of Mathematics, vol. 83 (1993), pp. 1–43.CrossRefGoogle Scholar
[2]Jensen, R., Some combinatorial properties of L and V, handwritten notes.Google Scholar
[3]Kanamori, A., The higher infinite, vol. II, preprint.Google Scholar
[4]Kunen, K., Set theory. An introduction to independence proofs.Google Scholar
[5]Mitchell, W. and Schimmerling, E., Weak covering without countable closure, Mathematical Research Letters, vol. 2 (1995), pp. 595–609.CrossRefGoogle Scholar
[6]Mitchell, W., Schimmerling, E., and Steel, J., The covering lemma up to a Woodin cardinal. Annals of Pure and Applied Logic, vol. 84 (1997), pp. 219–255.CrossRefGoogle Scholar
[7]Mitchell, W. and Schindler, R., A universal extender model without large cardinals in V, this Journal, vol. 69 (2004), pp. 371–386.Google Scholar
[8]Schindler, R., Core models in the presence of Woodin cardinals, this Journal, (to appear).Google Scholar
[9]Shelah, S., Around classification theory, Lecture Notes in Mathematics, no. 1182, Springer-Verlag, Berlin, 1986.CrossRefGoogle Scholar
[10]Steel, J., The core model iterability problem, Lecture Notes in Logic, no. 8, Springer Verlag, 1996.CrossRefGoogle Scholar
[11]Steel, J., Core models with more Woodin cardinals, this Journal, vol. 67 (2002), pp. 1197–1226.Google Scholar
[12]Steel, J., Scales in K(ℝ), Games, Scales, and Suslin Cardinals: The Cabal Seminar, Volume I (Kechris, A. S., Löwe, B., and Steel, J., editors), Lecture Notes in Logic, vol. 31, ASL and Cambridge University Press, 2008, pp. 176–208.CrossRefGoogle Scholar
[13]Steel, J., An outline of inner model theory, Handbook of set theory (Foreman, , Kanamori, , and Magidor, , editors), to appear.Google Scholar
[14]Steel, J., in preparation.Google Scholar
[15]Zeman, M., Inner models and large cardinals, Series in Logic and its Application, no. 5, de Gruyter, Berlin, New York, 2002.CrossRefGoogle Scholar