No CrossRef data available.
Coding with ladders a well ordering of the reals
Published online by Cambridge University Press: 12 March 2014
Any model of ZFC + GCH has a generic extension (made with a poset of size ℵ2) in which the following hold: there exists a-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.
- Research Article
- Copyright © Association for Symbolic Logic 2002