arXiv Analytics

Sign in

arXiv:math/0211244 [math.LO]AbstractReferencesReviewsResources

Hechler's theorem for the null ideal

Maxim R. Burke, Masaru Kada

Published 2002-11-15, updated 2004-02-22Version 8

We prove the following theorem: For a partially ordered set Q such that every countable subset has a strict upper bound, there is a forcing notion satisfying ccc such that, in the forcing model, there is a basis of the null ideal of the real line which is order-isomorphic to Q with respect to set-inclusion. This is a variation of Hechler's classical result in the theory of forcing, and the statement of the theorem for the meager ideal has been already proved by Bartoszynski and the author.

Comments: v8: Minor corrections
Journal: Arch. Math. Logic, Vol. 43(2004), pp. 703--722.
Categories: math.LO
Subjects: 03E35, 03E17
Related articles: Most relevant | Search more
arXiv:math/0209086 [math.LO] (Published 2002-09-09, updated 2003-07-29)
Hechler's theorem for the meager ideal
arXiv:1109.5307 [math.LO] (Published 2011-09-24)
Less than $2^ω$ many translates of a compact nullset may cover the real line
arXiv:2303.11532 [math.LO] (Published 2023-03-21)
Decomposing the real line into everywhere isomorphic suborders