Forcing with stable posets
Journal of Symbolic Logic 47 (1):37-42 (1982)
| Abstract | The class of stable posets is defined and investigated. We give a forcing construction of a universe of set theory which satisfies a weak form of Martin's Axiom and $2^{\aleph_0} > \aleph_1$ and yet some propositions which follow from CH hold in this universe | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,875 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesJustin Tatch Moore (2005). Proper Forcing, Cardinal Arithmetic, and Uncountable Linear Orders. Bulletin of Symbolic Logic 11 (1):51-60.
Uri Abraham & Saharon Shelah (2004). Ladder Gaps Over Stationary Sets. Journal of Symbolic Logic 69 (2):518 - 532.
Saharon Shelah & Lee J. Stanley (2001). Forcing Many Positive Polarized Partition Relations Between a Cardinal and its Powerset. Journal of Symbolic Logic 66 (3):1359-1370.
David Asperó (2002). A Maximal Bounded Forcing Axiom. Journal of Symbolic Logic 67 (1):130-142.
Jaime I. Ihoda & Saharon Shelah (1988). Souslin Forcing. Journal of Symbolic Logic 53 (4):1188-1207.
Todd Eisworth (2002). Forcing and Stable Ordered-Union Ultrafilters. Journal of Symbolic Logic 67 (1):449-464.
Alan H. Mekler (1984). C. C. C. Forcing Without Combinatorics. Journal of Symbolic Logic 49 (3):830-832.
Joan Bagaria & Roger Bosch (2004). Solovay Models and Forcing Extensions. Journal of Symbolic Logic 69 (3):742-766.
Uri Abraham & Saharon Shelah (1983). Forcing Closed Unbounded Sets. Journal of Symbolic Logic 48 (3):643-657.
Analytics
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2009-01-28Total downloads0Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
