The tree property at κ+ states that there are no Aronszajn trees on κ+, or, equivalently, that every κ+ tree has a cofinal branch. For singular strong limit cardinals κ, there is tension between the tree property at κ+ and failure of the singular cardinal hypothesis at κ; the former is typically the result of the presence of strongly compact cardinals in the background, and the latter is impossible above strongly compacts. In this paper, we reconcile the two. We prove (...) from large cardinals that the tree property at κ+ is consistent with failure of the singular cardinal hypothesis at κ. (shrink)

I examine various claims to the effect that Cantor's Continuum Hypothesis and other problems of higher set theory are ill-posed questions. The analysis takes into account the viability of the underlying philosophical views and recent mathematical developments.

This paper attempts to present and organize several problems in the theory of Singular Cardinals. The most famous problems in the area (bounds for the ℶ-function at singular cardinals) are well known to all mathematicians with even a rudimentary interest in set theory. However, it is less well known that the combinatorics of singular cardinals is a thriving area with results and problems that do not depend on a solution of the Singular Cardinals Hypothesis. We present here an annotated collection (...) of representative problems with some references. Where the problems are novel, attribution is attempted and it is noted where money is attached to particular problems. Three closely related themes are represented in these problems: stationary sets and stationary set reflection, variations of square and approachability, and the singular cardinals hypothesis. Underlying many of them are ideas from Shelah's PCF theory. Important subthemes were mutual stationarity, Aronszajn trees, and superatomic Boolean Algebras. The author notes considerable overlap between this paper and the unpublished report submitted to the Banff Center for the Workshop on Singular Cardinals Combinatorics, May 1–5, 2004. (shrink)