Switch to: References

Add citations

You must login to add citations.
  1. Coding with ladders a well ordering of the reals.Uri Abraham & Saharon Shelah - 2002 - Journal of Symbolic Logic 67 (2):579-597.
    Any model of ZFC + GCH has a generic extension (made with a poset of size ℵ 2 ) in which the following hold: MA + 2 ℵ 0 = ℵ 2 +there exists a Δ 2 1 -well ordering of the reals. The proof consists in iterating posets designed to change at will the guessing properties of ladder systems on ω 1 . Therefore, the study of such ladders is a main concern of this article.
    Download  
     
    Export citation  
     
    Bookmark   5 citations