Fine structure and iteration trees
Author(s)
Bibliographic Information
Fine structure and iteration trees
(Lecture notes in logic, 3)
Springer-Verlag, c1994
- : gw
- : us
Available at 30 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
-
Library, Research Institute for Mathematical Sciences, Kyoto University数研
: gwMIT||12||194010272
Note
Includes bibliographic references and index
Description and Table of Contents
Description
In these notes we construct an inner model with a Woodin cardinal, and develop fine structure theory for this model. Our model is of the form L[E], where E is a coherent sequence of extenders, and our work builds upon the existing theory of such models. In particular, we rely upon the fine structure theory of L[E] models with strong cardinals, which is due to Jensen, Solovay, Dodd-Jensen, and Mitchell, and upon the theory of iteration trees and "backgrounded" L[EJ models with Woodin cardinals, which is due to Martin and Steel. Our work is what results when fine structure meets iteration trees. One of our motivations was the desire to remove the severe limitations on the theory developed in [MS] caused by its use of an external comparison process. Because of this defect, the internal theory ofthe model L[E] constructed in [MS] is to a large extent a mystery. For example it is open whether the L[EJ of [MS] satisfies GCH. Moreover, the use of an external comparison process blocks the natural generalization to models with infinitely many Woodin cardinals of even the result [MS] does prove about L[E], that L[E] F= CH + ~ has a definable wellordering.
Our strategy for making the comparison process internal is due to Mitchell and actually predates [MS]. The strategy includes taking finely calibrated partial ultrapowers ("dropping to a mouse") at certain stages in the comparison process.
Table of Contents
0. Introduction.- 1. Good Extender Sequences.- 2. Fine Structure.- 3. Squashed Mice.- 4. Ultrapowers.- 5. Iteration Trees.- 6. Uniqueness of Wellfounded Branches.- 7. The Comparison Process.- 8. Solidity and Condensation.- 9. Uniqueness of the Next Extender.- 10. Closure under Initial Segment.- 11. The Construction.- 12. Iterability.- References.- Index of Definitions.
by "Nielsen BookData"