Coding with ladders a well-ordering of the reals

Simple item page
dc.creatorAbraham, Uri
dc.creatorShelah, Saharon
dc.date2001-04-19
dc.date.accessioned2026-07-07T04:41:23Z
dc.date.available2026-07-07T04:41:23Z
dc.descriptionAny model of ZFC + GCH has a generic extension (made with a poset of size aleph_2) in which the following hold: MA + 2^{aleph_0}= aleph_2+ there exists a Delta^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 omega_1. Therefore, the study of such ladders is a main concern of this article.
dc.identifierhttps://arxiv.org/abs/math/0104195
dc.identifierhttp://arxiv.org/abs/math/0104195
dc.identifierJ. Symbolic Logic 67 No. 2 (2002) 579--597
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/61336
dc.subjectLogic
dc.titleCoding with ladders a well-ordering of the reals
dc.typetext

Files

Collections

arXiv