Creatures on ω 1 and weak diamonds
Journal of Symbolic Logic 74 (1):1-16 (2009)
Abstract
We specialise Aronszajn trees by an $\omega ^\omega $ -bounding forcing that adds reals. We work with creature forcings on uncountable spaces. As an application of these notions of forcing, we answer a question of Moore, Hrušák and Džamonja whether ◇(b) implies the existence of a Souslin tree in a negative way by showing that "◇∂ and every Aronszajn tree is special" is consistent relative to ZFCDOI
10.2178/jsl/1231082299
My notes
Similar books and articles
Some telling examples: A reply to Tsohatzidis.Richard Holton - 1997 - Journal of Pragmatics 28:625-628.
Weak and global supervenience are strong.Mark Moyer - 2008 - Philosophical Studies 138 (1):125 - 150.
The Search for Diamonds: review of S. Shelah, Middle Diamond; S. Shelah, Diamonds; and M. Zeman, Diamond, GCH and Weak Square. [REVIEW]Assaf Rinot - 2010 - Bulletin of Symbolic Logic 16 (3):420 - 423.
Diamonds Are a Pragmaticist's Best Friend.Rosa Mayorga - 2005 - Transactions of the Charles S. Peirce Society 41 (2):255 - 270.
Authentic Faux Diamonds and Attention Deficit Disorder.Karen Anijar & David Gabbard - 2005 - American Journal of Bioethics 5 (3):67-70.
Ghosts and Sparse Properties: Why Physicalists Have More to Fear from Ghosts than Zombies.Philip Goff - 2010 - Philosophy and Phenomenological Research 81 (1):119-139.
Why Arguments from Expert Opinion are Weak Arguments.Moti Mizrahi - 2013 - Informal Logic 33 (1):57-79.
Analytics
Added to PP
2010-09-12
Downloads
9 (#938,393)
6 months
1 (#455,463)
2010-09-12
Downloads
9 (#938,393)
6 months
1 (#455,463)
Historical graph of downloads
Citations of this work
Finding generic filters by playing games.Heike Mildenberger - 2010 - Archive for Mathematical Logic 49 (1):91-118.
References found in this work
There may be simple Pℵ1 and Pℵ2-points and the Rudin-Keisler ordering may be downward directed.Andreas Blass & Saharon Shelah - 1987 - Annals of Pure and Applied Logic 33 (C):213-243.
Iterated perfect-set forcing.James E. Baumgartner & Richard Laver - 1979 - Annals of Mathematical Logic 17 (3):271-288.
The fine structure of the constructible hierarchy.R. Björn Jensen - 1972 - Annals of Mathematical Logic 4 (3):229.
Specialising Aronszajn trees by countable approximations.Heike Mildenberger & Saharon Shelah - 2003 - Archive for Mathematical Logic 42 (7):627-647.