9 found
Order:
  1.  16
    Iterated Perfect-Set Forcing.James E. Baumgartner & Richard Laver - 1979 - Annals of Mathematical Logic 17 (3):271-288.
  2.  26
    Certain Very Large Cardinals Are Not Created in Small Forcing Extensions.Richard Laver - 2007 - Annals of Pure and Applied Logic 149 (1-3):1-6.
    The large cardinal axioms of the title assert, respectively, the existence of a nontrivial elementary embedding j:Vλ→Vλ, the existence of such a j which is moreover , and the existence of such a j which extends to an elementary j:Vλ+1→Vλ+1. It is known that these axioms are preserved in passing from a ground model to a small forcing extension. In this paper the reverse directions of these preservations are proved. Also the following is shown : if V is a model (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   21 citations  
  3.  11
    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.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   13 citations  
  4.  9
    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 ”.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  5.  17
    R. Björn Jensen. The Fine Structure of the Constructible Hierarchy. Annals of Mathematical Logic, Vol. 4 No. 3 , Pp. 229–308. [REVIEW]Richard Laver - 1975 - Journal of Symbolic Logic 40 (4):632-633.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  6.  10
    Robert M. Solovay. A Model of Set-Theory in Which Every Set of Reals is Lebesgue Measurable. Annals of Mathematics, Ser. 2 Vol. 92 , Pp. 1–56. [REVIEW]Richard Laver - 1973 - Journal of Symbolic Logic 38 (3):529.
  7.  16
    Annual Meeting of the Association for Symbolic Logic Denver, 1983.Carl G. Jockusch, Richard Laver, Donald Monk, Jan Mycielski & Jon Pearce - 1984 - Journal of Symbolic Logic 49 (2):674 - 682.
  8.  7
    Review: Robert M. Solovay, A Model of Set-Theory in Which Every Set of Reals is Lebesgue Measurable. [REVIEW]Richard Laver - 1973 - Journal of Symbolic Logic 38 (3):529-529.
  9.  5
    Generic Graph Construction.James E. Baumgartner, Matthew Foreman, Richard Laver, Saharon Shelah & A. Baker - 2001 - Bulletin of Symbolic Logic 7 (4):539-541.
    Direct download  
     
    Export citation  
     
    Bookmark