Switch to: References

Add citations

You must login to add citations.
  1. 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  
  • Implications between strong large cardinal axioms.Richard Laver - 1997 - Annals of Pure and Applied Logic 90 (1-3):79-90.
    The rank-into-rank and stronger large cardinal axioms assert the existence of certain elementary embeddings. By the preservation of the large cardinal properties of the embeddings under certain operations, strong implications between various of these axioms are derived.
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • Suitable extender models I.W. Hugh Woodin - 2010 - Journal of Mathematical Logic 10 (1):101-339.
    We investigate both iteration hypotheses and extender models at the level of one supercompact cardinal. The HOD Conjecture is introduced and shown to be a key conjecture both for the Inner Model Program and for understanding the limits of the large cardinal hierarchy. We show that if the HOD Conjecture is true then this provides strong evidence for the existence of an ultimate version of Gödel's constructible universe L. Whether or not this "ultimate" L exists is now arguably the central (...)
    Download  
     
    Export citation  
     
    Bookmark   35 citations  
  • LD-Algebras Beyond I0.Vincenzo Dimonte - 2019 - Notre Dame Journal of Formal Logic 60 (3):395-405.
    The algebra of embeddings at the I3 level has been deeply analyzed, but nothing is known algebra-wise for embeddings above I3. In this article, we introduce an operation for embeddings at the level of I0 and above, and prove that they generate an LD-algebra that can be quite different from the one implied by I3.
    Download  
     
    Export citation  
     
    Bookmark  
  • (1 other version)The covering lemma up to a Woodin cardinal.W. J. Mitchell, E. Schimmerling & J. R. Steel - 1997 - Annals of Pure and Applied Logic 84 (2):219-255.
    Download  
     
    Export citation  
     
    Bookmark   26 citations  
  • The structure of the Mitchell order – II.Omer Ben-Neria - 2015 - Annals of Pure and Applied Logic 166 (12):1407-1432.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Infinite decreasing chains in the Mitchell order.Omer Ben-Neria & Sandra Müller - 2021 - Archive for Mathematical Logic 60 (6):771-781.
    It is known that the behavior of the Mitchell order substantially changes at the level of rank-to-rank extenders, as it ceases to be well-founded. While the possible partial order structure of the Mitchell order below rank-to-rank extenders is considered to be well understood, little is known about the structure in the ill-founded case. The purpose of the paper is to make a first step in understanding this case, by studying the extent to which the Mitchell order can be ill-founded. Our (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Reflection of elementary embedding axioms on the L[Vλ+1] hierarchy.Richard Laver - 2001 - Annals of Pure and Applied Logic 107 (1-3):227-238.
    Say that the property Φ of a cardinal λ strongly implies the property Ψ. If and only if for every λ,Φ implies that Ψ and that for some λ′<λ,Ψ. Frequently in the hierarchy of large cardinal axioms, stronger axioms strongly imply weaker ones. Some strong implications are proved between axioms of the form “there is an elementary embedding j:Lα[Vλ+1]→Lα[Vλ+1] with ”.
    Download  
     
    Export citation  
     
    Bookmark   8 citations