Supercomplete extenders and type 1 mice: Part I

Q. Feng, R. Jensen
2004 Annals of Pure and Applied Logic  
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 coÿnal branch. We give a construction of an K C type model using supercomplete type 1 extenders.
doi:10.1016/j.apal.2003.12.002 fatcat:iippfzjrhvb2nn2npthsxk7zju