Creatures on ω 1 and weak diamonds

Journal of Symbolic Logic 74 (1):1-16 (2009)
  Copy   BIBTEX

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 ZFC

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,891

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

Specializing Aronszajn Trees with Strong Axiom A and Halving.Heike Mildenberger & Saharon Shelah - 2019 - Notre Dame Journal of Formal Logic 60 (4):587-616.
Finding generic filters by playing games.Heike Mildenberger - 2010 - Archive for Mathematical Logic 49 (1):91-118.
On wide Aronszajn trees in the presence of ma.Mirna Džamonja & Saharon Shelah - 2021 - Journal of Symbolic Logic 86 (1):210-223.
Aronszajn and Kurepa trees.James Cummings - 2018 - Archive for Mathematical Logic 57 (1-2):83-90.
Gap structure after forcing with a coherent Souslin tree.Carlos Martinez-Ranero - 2013 - Archive for Mathematical Logic 52 (3-4):435-447.
P-ideal dichotomy and weak squares.Dilip Raghavan - 2013 - Journal of Symbolic Logic 78 (1):157-167.
Aronszajn lines and the club filter.Justin Tatch Moore - 2008 - Journal of Symbolic Logic 73 (3):1029-1035.
A forcing axiom for a non-special Aronszajn tree.John Krueger - 2020 - Annals of Pure and Applied Logic 171 (8):102820.

Analytics

Added to PP
2010-09-12

Downloads
15 (#947,122)

6 months
6 (#701,126)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Finding generic filters by playing games.Heike Mildenberger - 2010 - Archive for Mathematical Logic 49 (1):91-118.

Add more citations

References found in this work

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.

Add more references