The saturation of club guessing ideals

Annals of Pure and Applied Logic 142 (1):398-424 (2006)
  Copy   BIBTEX

Abstract

We prove that it is consistent that there exists a saturated tail club guessing ideal on ω1 which is not a restriction of the non-stationary ideal. Two proofs are presented. The first one uses a new forcing axiom whose consistency can be proved from a supercompact cardinal. The resulting model can satisfy either CH or 20=2. The second one is a direct proof from a Woodin cardinal, which gives a witnessing model with CH

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,440

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

Some results about (+) proved by iterated forcing.Tetsuya Ishiu & Paul B. Larson - 2012 - Journal of Symbolic Logic 77 (2):515-531.
Club guessing sequences and filters.Tetsuya Ishiu - 2005 - Journal of Symbolic Logic 70 (4):1037-1071.
Club Guessing and the Universal Models.Mirna Džamonja - 2005 - Notre Dame Journal of Formal Logic 46 (3):283-300.
Aronszajn lines and the club filter.Justin Tatch Moore - 2008 - Journal of Symbolic Logic 73 (3):1029-1035.
Notes on Singular Cardinal Combinatorics.James Cummings - 2005 - Notre Dame Journal of Formal Logic 46 (3):251-282.
Weak saturation of ideals on Pκ(λ).Pierre Matet - 2011 - Mathematical Logic Quarterly 57 (2):149-165.
Club-guessing, stationary reflection, and coloring theorems.Todd Eisworth - 2010 - Annals of Pure and Applied Logic 161 (10):1216-1243.
A saturation property of ideals and weakly compact cardinals.Joji Takahashi - 1986 - Journal of Symbolic Logic 51 (3):513-525.

Analytics

Added to PP
2013-12-31

Downloads
12 (#1,092,281)

6 months
3 (#984,658)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations