Switch to: Citations

Add references

You must login to add references.
  1. Nonexistence of universal orders in many cardinals.Menachem Kojman & Saharon Shelah - 1992 - Journal of Symbolic Logic 57 (3):875-891.
    Our theme is that not every interesting question in set theory is independent of ZFC. We give an example of a first order theory T with countable D(T) which cannot have a universal model at ℵ1 without CH; we prove in ZFC a covering theorem from the hypothesis of the existence of a universal model for some theory; and we prove--again in ZFC--that for a large class of cardinals there is no universal linear order (e.g. in every regular $\aleph_1 < (...)
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  • Independence results.Saharon Shelah - 1980 - Journal of Symbolic Logic 45 (3):563-573.
    We prove independence results concerning the number of nonisomorphic models (using the S-chain condition and S-properness) and the consistency of "ZCF + 2 ℵ 0 = ℵ 2 + there is a universal linear order of power ℵ 1 ". Most of these results were announced in [Sh 4], [Sh 5]. In subsequent papers we shall prove an analog f MA for forcing which does not destroy stationary subsets of ω 1 , investigate D-properness for various filters and prove the (...)
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Trees and Π 1 1 -Subsets of ω1 ω 1.Alan Mekler & Jouko Vaananen - 1993 - Journal of Symbolic Logic 58 (3):1052 - 1070.
    We study descriptive set theory in the space ω1 ω 1 by letting trees with no uncountable branches play a similar role as countable ordinals in traditional descriptive set theory. By using such trees, we get, for example, a covering property for the class of Π 1 1 -sets of ω1 ω 1 . We call a family U of trees universal for a class V of trees if $\mathscr{U} \subseteq \mathscr{V}$ and every tree in V can be order-preservingly mapped (...)
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • 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  
  • On universal graphs without instances of CH.Saharon Shelah - 1984 - Annals of Pure and Applied Logic 26 (1):75-87.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • (1 other version)Trees and -subsets of ω1ω1.Alan Mekler & Jouko Väänänen - 1993 - Journal of Symbolic Logic 58 (3):1052-1070.
    Download  
     
    Export citation  
     
    Bookmark   12 citations