Supercomplete extenders and type 1 mice: Part I

Annals of Pure and Applied Logic 128 (1-3):1-73 (2004)
  Copy   BIBTEX

Abstract

We study type 1 premice equipped with supercomplete extenders. In this paper, we show that such premice are normally iterable and all normal iteration trees of type 1 premice has a unique cofinal branch. We give a construction of an KC type model using supercomplete type 1 extenders

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,592

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
2014-01-16

Downloads
16 (#900,320)

6 months
2 (#1,192,610)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Hypermachines.Sy-David Friedman & P. D. Welch - 2011 - Journal of Symbolic Logic 76 (2):620 - 636.
Determinacy in strong cardinal models.P. D. Welch - 2011 - Journal of Symbolic Logic 76 (2):719 - 728.

Add more citations

References found in this work

The core model for almost linear iterations.Ralf-Dieter Schindler - 2002 - Annals of Pure and Applied Logic 116 (1-3):205-272.
The Core Model Iterability Problem.J. R. Steei - 2001 - Studia Logica 67 (1):124-127.

Add more references