pith. sign in

arxiv: math/0211244 · v8 · submitted 2002-11-15 · 🧮 math.LO

Hechler's theorem for the null ideal

classification 🧮 math.LO
keywords forcingidealtheoremhechlernulltherealreadyauthor
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.