Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-17T21:29:18.326Z Has data issue: false hasContentIssue false

Coding with ladders a well ordering of the reals

Published online by Cambridge University Press:  12 March 2014

Uri Abraham
Affiliation:
Department of Mathematics and Computer Science, Ben-Gurion University, Be'er-Sheva, Israel, E-mail: abraham@cs.bgu.ac.il
Saharon Shelah
Affiliation:
Institute of Mathematics, The Hebrew University, Jerusalem, Israel, E-mail: shelah@math.huji.ac.il

Abstract

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.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2002

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable