We investigate questions involving Aronszajn trees, square principles, and stationary reflection. We first consider two strengthenings of introduced by Brodsky and Rinot for the purpose of constructing κ‐Souslin trees. Answering a question of Rinot, we prove that the weaker of these strengthenings is compatible with stationary reflection at κ but the stronger is not. We then prove that, if μ is a singular cardinal, implies the existence of a special ‐tree with a cf(μ)‐ascent path, thus answering a question of Lücke.

Gitik and Rinot (Trans Am Math Soc 364(4):1771–1795, 2012) proved assuming the existence of a supercompact that it is consistent to have a strong limit cardinal $$\kappa $$ of countable cofinality such that $$2^\kappa =\kappa ^+$$, there is a very good scale at $$\kappa $$, and $$\diamond $$ fails along some reflecting stationary subset of $$\kappa ^+\cap \text {cof}(\omega )$$. In this paper, we force over Gitik and Rinot’s model but with a modification of Gitik–Sharon (Proc Am Math Soc 136(1):311, (...) 2008) diagonal Prikry forcing to get this result for $$\kappa =\aleph _{\omega ^2}$$. (shrink)

We revisit several results concerning club principles and nonsaturation of the nonstationary ideal, attempting to improve them in various ways. So we typically deal with a ideal J extending the nonstationary ideal on a regular uncountable cardinal \, our goal being to witness the nonsaturation of J by the existence of towers ).

We continue our study of strongly unbounded colorings, this time focusing on subadditive maps. In Part I of this series, we showed that, for many pairs of infinite cardinals $\theta < \kappa $, the existence of a strongly unbounded coloring $c:[\kappa ]^2 \rightarrow \theta $ is a theorem of $\textsf{ZFC}$. Adding the requirement of subadditivity to a strongly unbounded coloring is a significant strengthening, though, and here we see that in many cases the existence of a subadditive strongly unbounded coloring (...) $c:[\kappa ]^2 \rightarrow \theta $ is independent of $\textsf{ZFC}$. We connect the existence of subadditive strongly unbounded colorings with a number of other infinitary combinatorial principles, including the narrow system property, the existence of $\kappa $ -Aronszajn trees with ascent paths, and square principles. In particular, we show that the existence of a closed, subadditive, strongly unbounded coloring $c:[\kappa ]^2 \rightarrow \theta $ is equivalent to a certain weak indexed square principle $\boxminus ^{\operatorname {\mathrm {ind}}}(\kappa, \theta )$. We conclude the paper with an application to the failure of the infinite productivity of $\kappa $ -stationarily layered posets, answering a question of Cox. (shrink)

We study the role of meeting numbers in pcf theory. In particular, Shelah's Strong Hypothesis is shown to be equivalent to the assertion that for any singular cardinal σ of cofinality ω, there is a size collection Q of countable subsets of σ with the property that for any infinite subset a of σ, there is a member of Q meeting a in an infinite set.