Fine structure and iteration trees
著者
書誌事項
Fine structure and iteration trees
(Lecture notes in logic, 3)
Springer-Verlag, c1994
- : gw
- : us
大学図書館所蔵 全30件
  青森
  岩手
  宮城
  秋田
  山形
  福島
  茨城
  栃木
  群馬
  埼玉
  千葉
  東京
  神奈川
  新潟
  富山
  石川
  福井
  山梨
  長野
  岐阜
  静岡
  愛知
  三重
  滋賀
  京都
  大阪
  兵庫
  奈良
  和歌山
  鳥取
  島根
  岡山
  広島
  山口
  徳島
  香川
  愛媛
  高知
  福岡
  佐賀
  長崎
  熊本
  大分
  宮崎
  鹿児島
  沖縄
  韓国
  中国
  タイ
  イギリス
  ドイツ
  スイス
  フランス
  ベルギー
  オランダ
  スウェーデン
  ノルウェー
  アメリカ
注記
Includes bibliographic references and index
内容説明・目次
内容説明
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.
目次
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.
「Nielsen BookData」 より