Hechler’s theorem for the null ideal

Archive for Mathematical Logic 43 (5):703-722 (2004)
  Copy   BIBTEX

Abstract

We prove the following theorem: For a partially ordered set Q such that every countable subset of Q has a strict upper bound, there is a forcing notion satisfying the countable chain condition such that, in the forcing extension, 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. The corresponding theorem for the meager ideal was established by Bartoszyński and Kada.

Other Versions

No versions found

Similar books and articles

Hechler's theorem for tall analytic p-ideals.Barnabás Farkas - 2011 - Journal of Symbolic Logic 76 (2):729 - 736.
Hechler reals.Grzegorz Łabędzki & Miroslav Repický - 1995 - Journal of Symbolic Logic 60 (2):444-458.
Unbounded and dominating reals in Hechler extensions.Justin Palumbo - 2013 - Journal of Symbolic Logic 78 (1):275-289.
Covering properties of ideals.Marek Balcerzak, Barnabás Farkas & Szymon Gła̧b - 2013 - Archive for Mathematical Logic 52 (3-4):279-294.
Forcing disabled.M. C. Stanley - 1992 - Journal of Symbolic Logic 57 (4):1153-1175.
Preserving Non-null with Suslin+ Forcings.Jakob Kellner - 2006 - Archive for Mathematical Logic 45 (6):649-664.
A proofless proof of the Barwise compactness theorem.Mark Howard - 1988 - Journal of Symbolic Logic 53 (2):597-602.

Analytics

Added to PP
2013-11-23

Downloads
153 (#276,224)

6 months
35 (#242,639)

Historical graph of downloads
How can I increase my downloads?