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 investigate the relationship between weak square principles and simultaneous reflection of stationary sets.

Motivated by a characterization of weakly compact cardinals due to Todorcevic, we introduce a new cardinal characteristic, the C-sequence number, which can be seen as a measure of the compactness of a regular uncountable cardinal. We prove a number of ZFC and independence results about the C-sequence number and its relationship with large cardinals, stationary reflection, and square principles. We then introduce and study the more general C-sequence spectrum and uncover some tight connections between the C-sequence spectrum and the strong (...) coloring principle U(. . .), introduced in Part I of this series. (shrink)

In this paper we investigate the consistency and consequences of the downward Löwenheim–Skolem–Tarski theorem for extension of the first order logic by the Magidor–Malitz quantifier. We derive some combinatorial results and improve the known upper bound for the consistency of Chang’s conjecture at successor of singular cardinals.

In this paper we investigate some properties of forcing which can be considered “nice” in the context of singularizing regular cardinals to have an uncountable cofinality. We show that such forcing which changes cofinality of a regular cardinal, cannot be too nice and must cause some “damage” to the structure of cardinals and stationary sets. As a consequence there is no analogue to the Prikry forcing, in terms of “nice” properties, when changing cofinalities to be uncountable.

We point out some connections between existence of homogenous sets for certain edge colorings and existence of branches in certain trees. As a consequence, we get that any locally additive coloring (a notion introduced in the paper) of a cardinal κ has a homogeneous set of size κ provided that the number of colors μ satisfies. Another result is that an uncountable cardinal κ is weakly compact if and only if κ is regular, has the tree property, and for each (...) there exists such that every tree of height μ with λ nodes has less than branches. (shrink)

We formulate combinatorial principles that combine the square principle with various strong forms of the diamond principle, and prove that the strongest amongst them holds inLfor every infinite cardinal.As an application, we prove that the following two hold inL:1.For every infinite regular cardinalλ, there exists a special λ+-Aronszajn tree whose projection is almost Souslin;2.For every infinite cardinalλ, there exists arespectingλ+-Kurepa tree; Roughly speaking, this means that this λ+-Kurepa tree looks very much like the λ+-Souslin trees that Jensen constructed inL.

James Earl Baumgartner (March 23, 1943–December 28, 2011) came of age mathematically during the emergence of forcing as a fundamental technique of set theory, and his seminal research changed the way set theory is done. He made fundamental contributions to the development of forcing, to our understanding of uncountable orders, to the partition calculus, and to large cardinals and their ideals. He promulgated the use of logic such as absoluteness and elementary submodels to solve problems in set theory, he applied (...) his knowledge of set theory to a variety of areas in collaboration with other mathematicians, and he encouraged a community of mathematicians with engaging survey talks, enthusiastic discussions of open problems, and friendly mathematical conversations. (shrink)