Coding with ladders a well-ordering of the reals
Abstract
Any model of ZFC + GCH has a generic extension (made with a poset of size aleph2) in which the following hold: MA + 2aleph0= aleph2+ there exists a Delta21-well ordering of the reals. The proof consists in iterating posets designed to change at will the guessing properties of ladder systems on omega1. Therefore, the study of such ladders is a main concern of this article.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.