Switch to: Citations

Add references

You must login to add references.
  1. Trees and Ehrenfeucht–Fraı̈ssé games.Stevo Todorčević & Jouko Väänänen - 1999 - Annals of Pure and Applied Logic 100 (1-3):69-97.
    Trees are natural generalizations of ordinals and this is especially apparent when one tries to find an uncountable analogue of the concept of the Scott-rank of a countable structure. The purpose of this paper is to introduce new methods in the study of an ordering between trees whose analogue is the usual ordering between ordinals. For example, one of the methods is the tree-analogue of the successor operation on the ordinals.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   27 citations  
  • Large cardinals and locally defined well-orders of the universe.David Asperó & Sy-David Friedman - 2009 - Annals of Pure and Applied Logic 157 (1):1-15.
    By forcing over a model of with a class-sized partial order preserving this theory we produce a model in which there is a locally defined well-order of the universe; that is, one whose restriction to all levels H is a well-order of H definable over the structure H, by a parameter-free formula. Further, this forcing construction preserves all supercompact cardinals as well as all instances of regular local supercompactness. It is also possible to define variants of this construction which, in (...)
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Some applications of almost disjoint forcing.R. B. Jensen & R. M. Solovay - 1970 - In Yehoshua Bar-Hillel (ed.), Mathematical logic and foundations of set theory. Amsterdam,: North-Holland Pub. Co..
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  • The Higher Infinite.Akihiro Kanamori - 2000 - Studia Logica 65 (3):443-446.
    Download  
     
    Export citation  
     
    Bookmark   212 citations