pith. sign in

arxiv: math/0209086 · v2 · submitted 2002-09-09 · 🧮 math.LO

Hechler's theorem for the meager ideal

classification 🧮 math.LO
keywords forcinghechleridealmeagertheoremtherebasisbound
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 meager 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.

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.