Coding with ladders a well ordering of the reals
From MaRDI portal
Abstract: Any 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.
Recommendations
Cites work
- A \({\Delta{}}^ 2_ 2\) well-order of the reals and incompactness of \(L(Q^{MM})\)
- scientific article; zbMATH DE number 1113072 (Why is no real title available?)
- Large cardinals imply that every reasonably definable set of reals is Lebesgue measurable
- Long projective wellorderings
- Martin's axiom and _1² well-ordering of the reals
Cited in
(9)- Large cardinals and locally defined well-orders of the universe
- A \({\Delta{}}^ 2_ 2\) well-order of the reals and incompactness of \(L(Q^{MM})\)
- Martin's axiom and _1² well-ordering of the reals
- Generic absoluteness and the continuum
- Forcing lightface definable well-orders without the GCH
- On ordinary and standard products of infinite family of \(\sigma \)-finite measures and some of their applications
- Coding by club-sequences
- Descriptive inner model theory
- Definable well-orders of \(H(\omega _2)\) and GCH
This page was built for publication: Coding with ladders a well ordering of the reals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3149984)