Switch to: Citations

Add references

You must login to add references.
  1. (1 other version)The Core Model.A. Dodd, R. Jensen, Tony Dodd, Ronald Jensen, A. J. Dodd & R. B. Jensen - 1984 - Journal of Symbolic Logic 49 (2):660-662.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • (1 other version)The core model.A. Dodd & R. Jensen - 1981 - Annals of Mathematical Logic 20 (1):43-75.
    Download  
     
    Export citation  
     
    Bookmark   59 citations  
  • The covering lemma for K.Tony Dodd & Ronald Jensen - 1982 - Annals of Mathematical Logic 22 (1):1-30.
    Download  
     
    Export citation  
     
    Bookmark   23 citations  
  • Inner models with many Woodin cardinals.J. R. Steel - 1993 - Annals of Pure and Applied Logic 65 (2):185-209.
    We extend the theory of “Fine structure and iteration trees” to models having more than one Woodin cardinal.
    Download  
     
    Export citation  
     
    Bookmark   35 citations  
  • The consistency strength of projective absoluteness.Kai Hauser - 1995 - Annals of Pure and Applied Logic 74 (3):245-295.
    It is proved that in the absence of proper class inner models with Woodin cardinals, for each n ε {1,…,ω}, ∑3 + n1 absoluteness implies there are n strong cardinals in K (where this denotes a suitably defined global version of the core model for one Woodin cardinal as exposed by Steel. Combined with a forcing argument of Woodin, this establishes that the consistency strength of ∑3 + n1 absoluteness is exactly that of n strong cardinals so that in particular (...)
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • Some applications of iterated ultrapowers in set theory.Kenneth Kunen - 1970 - Annals of Mathematical Logic 1 (2):179.
    Download  
     
    Export citation  
     
    Bookmark   97 citations  
  • How to win some simple iteration games.Alessandro Andretta & John Steel - 1997 - Annals of Pure and Applied Logic 83 (2):103-164.
    We introduce two new iteration games: the game , which is a strengthening of the weak iteration game, and the game , which is somewhat stronger than but weaker than the full iteration game of length ω1. For a countable M elementarily embeddable in some Vη, with two players I and II, we can show that II wins and that I does not win.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Sets constructible from sequences of ultrafilters.William J. Mitchell - 1974 - Journal of Symbolic Logic 39 (1):57-66.
    In [4], Kunen used iterated ultrapowers to show that ifUis a normalκ-complete nontrivial ultrafilter on a cardinalκthenL[U], the class of sets constructive fromU, has only the ultrafilterU∩L[U] and this ultrafilter depends only onκ. In this paper we extend Kunen's methods to arbitrary sequencesUof ultrafilters and obtain generalizations of these results. In particular we answer Problem 1 of Kunen and Paris [5] which asks whether the number of ultrafilters onκcan be intermediate between 1 and 22κ. If there is a normalκ-complete ultrafilterUonκsuch (...)
    Download  
     
    Export citation  
     
    Bookmark   33 citations  
  • Iteration Trees.D. A. Martin & J. R. Steel - 2002 - Bulletin of Symbolic Logic 8 (4):545-546.
    Download  
     
    Export citation  
     
    Bookmark   16 citations