Hechler's theorem for tall analytic p-ideals

Journal of Symbolic Logic 76 (2):729 - 736 (2011)
  Copy   BIBTEX

Abstract

We prove the following version of Hechler's classical theorem: For each partially ordered set (Q, ≤) with the property that every countable subset of Q has a strict upper bound in Q, there is a ccc forcing notion such that in the generic extension for each tall analytic P-ideal J (coded in the ground model) a cofinal subset of (J, ⊆*) is order isomorphic to (Q, ≤)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,349

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Hechler reals.Grzegorz Łabędzki & Miroslav Repický - 1995 - Journal of Symbolic Logic 60 (2):444-458.
Why vagueness is a mystery.Peter van Inwagen - 2002 - Acta Analytica 17 (1):11 - 17.
On non-wellfounded iterations of the perfect set forcing.Vladimir Kanovei - 1999 - Journal of Symbolic Logic 64 (2):551-574.
Spector forcing.J. M. Henle - 1984 - Journal of Symbolic Logic 49 (2):542-554.
Why vagueness is a mystery.Peter Inwagen - 2002 - Acta Analytica 17 (2):11-17.
Continuum-Many Boolean Algebras of the Form [image] Borel.Michael Ray Oliver - 2004 - Journal of Symbolic Logic 69 (3):799 - 816.
The Strength of the Rainbow Ramsey Theorem.Barbara F. Csima & Joseph R. Mileti - 2009 - Journal of Symbolic Logic 74 (4):1310 - 1324.
Pseudoprojective strongly minimal sets are locally projective.Steven Buechler - 1991 - Journal of Symbolic Logic 56 (4):1184-1194.
One theorem of Zil′ber's on strongly minimal sets.Steven Buechler - 1985 - Journal of Symbolic Logic 50 (4):1054-1061.
More about uniform upper Bounds on ideals of Turing degrees.Harold T. Hodes - 1983 - Journal of Symbolic Logic 48 (2):441-457.

Analytics

Added to PP
2013-09-30

Downloads
52 (#299,008)

6 months
6 (#522,885)

Historical graph of downloads
How can I increase my downloads?