Coding with ladders a well ordering of the reals

Journal of Symbolic Logic 67 (2):579-597 (2002)
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
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2178/jsl/1190150099
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 24,392
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA
Leo Harrington (1977). Long Projective Wellorderings. Annals of Mathematical Logic 12 (1):1-24.

Add more references

Citations of this work BETA
David Asperó (2006). Coding by Club-Sequences. Annals of Pure and Applied Logic 142 (1):98-114.

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

24 ( #197,824 of 1,924,700 )

Recent downloads (6 months)

1 ( #417,761 of 1,924,700 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.