Since the work of Gödel and Cohen, which showed that Hilbert's First Problem was independent of the usual assumptions of mathematics, there have been a myriad of independence results in many areas of mathematics. These results have led to the systematic study of several combinatorial principles that have proven effective at settling many of the important independent statements. Among the most prominent of these are the principles diamond and square discovered by Jensen. Simultaneously, attempts have been made to find suitable (...) natural strengthenings of ZFC, primarily by Large Cardinal or Reflection Axioms. These two directions have tension between them in that Jensen's principles, which tend to suggest a rather rigid mathematical universe, are at odds with reflection properties. A third development was the discovery by Shelah of "PCF Theory", a generalization of cardinal arithmetic that is largely determined inside ZFC. In this paper we consider interactions between these three theories in the context of singular cardinals, focusing on the various implications between square and scales, and on consistency results between relatively strong forms of square and stationary set reflection. (shrink)

Three central combinatorial properties in set theory are the tree property, the approachability property and stationary reflection. We prove the mutual independence of these properties by showing that any of their eight Boolean combinations can be forced to hold at${\kappa ^{ + + }}$, assuming that$\kappa = {\kappa ^{ < \kappa }}$and there is a weakly compact cardinal aboveκ.If in additionκis supercompact then we can forceκto be${\aleph _\omega }$in the extension. The proofs combine the techniques of adding and then destroying (...) a nonreflecting stationary set or a${\kappa ^{ + + }}$-Souslin tree, variants of Mitchell’s forcing to obtain the tree property, together with the Prikry-collapse poset for turning a large cardinal into${\aleph _\omega }$. (shrink)

We give modest upper bounds for consistency strengths for two well-studied combinatorial principles. These bounds range at the level of subcompact cardinals, which is significantly below a κ+-supercompact cardinal. All previously known upper bounds on these principles ranged at the level of some degree of supercompactness. We show that by using any of the standard modified Prikry forcings it is possible to turn a measurable subcompact cardinal into ℵω and make the principle □ℵω,<ω fail in the generic extension. We also (...) show that by using Lévy collapse followed by standard iterated club shooting it is possible to turn a subcompact cardinal into ℵ2 and arrange in the generic extension that simultaneous reflection holds at ℵ2, and at the same time, every stationary subset of ℵ3 concentrating on points of cofinality ω has a reflection point of cofinality ω1. (shrink)

It is relatively consistent with the existence of two supercompact cardinals that a special Aronszajn tree of height ${\aleph_{\omega_1+1}}$ is introduced by a cofinality-preserving forcing of size ${\aleph_3}$.

We consider a class of Lindström extensions of first-order logic which are susceptible to a natural Skolemization procedure. In these logics Ehrenfeucht Mostowski (EM) functors for theories with arbitrarily large models can be obtained under suitable restrictions. Characteristic dependencies between algebraic properties of the quantifiers and the maximal domains of EM functors are investigated.Results are applied to Magidor Malitz logic,L(Q <ω), showing e.g. its Hanf number to be equal to ℶω(ℵ1) in the countably compact case. Using results of Baumgartner, the (...) maximal number of isomorphism types of linearly ordered models of regular cardinality is shown to be achieved for theories that admit an EM functor on a typically restricted domain. (shrink)

Two structures are said to be equimorphic if each embeds in the other. Such structures cannot be expected to be isomorphic, and in this paper we investigate the special case of linear orders, here also called chains. In particular we provide structure results for chains having less than continuum many isomorphism classes of equimorphic chains. We deduce as a corollary that any chain has either a single isomorphism class of equimorphic chains or infinitely many.

For an uncountable cardinal κ, let be the assertion that every ω1‐stationary preserving poset of size is semiproper. We prove that is a strong principle which implies a strong form of Chang's conjecture. We also show that implies that is presaturated.

The existence of End Elementary Extensions of models M of ZFC is related to the ordinal height of M, according to classical results due to Keisler, Morley and Silver. In this paper, we further investigate the connection between the height of M and the existence of End Elementary Extensions of M. In particular, we prove that the theory `ZFC + GCH + there exist measurable cardinals + all inaccessible non weakly compact cardinals are possible heights of models with no End (...) Elementary Extensions' is consistent relative to the theory `ZFC + GCH + there exist measurable cardinals + the weakly compact cardinals are cofinal in ON'. We also provide a simpler coding that destroys GCH but otherwise yields the same result. (shrink)

Suppose that λ is the successor of a singular cardinal μ whose cofinality is an uncountable cardinal κ. We give a sufficient condition that the club filter of λ concentrating on the points of cofinality κ is not λ+-saturated.1 The condition is phrased in terms of a notion that we call weak reflection. We discuss various properties of weak reflection. We introduce a weak version of the ♣-principle, which we call ♣*−, and show that if it holds on a stationary (...) subset S of λ, then no normal filter on S is λ+-saturated. Under the above assumptions, ♣*− is true for any stationary subset S of λ which does not contain points of cofinality κ. For stationary sets S which concentrate on points of cofinality κ, we show that ♣*− holds modulo an ideal obtained through the weak reflection. (shrink)

We prove covering theorems for K, where K is the core model below the sharp for a strong cardinal, and give an application to stationary set reflection.

We characterize the tree of functions with finite support in terms of definability. This turns out to have various applications: a new kind of tree dichotomy for ω1 on the one hand. On the other hand, we prove a reflection principle for trees on ω2 under SPFA. This reflection of trees implies stationary reflection.

We show that if κ is a weakly compact cardinal then the embeddability relation on trees of size κ is invariantly universal. This means that for every analytic quasi-order R on the generalized Cantor space View the MathML source there is an Lκ+κ-sentence φ such that the embeddability relation on its models of size κ, which are all trees, is Borel bi-reducible to R. In particular, this implies that the relation of embeddability on trees of size κ is complete for (...) analytic quasi-orders on View the MathML source. These facts generalize analogous results for κ=ω obtained in Louveau and Rosendal [17] and Friedman and Motto Ros [6], and it also partially extends a result from Baumgartner [3] concerning the structure of the embeddability relation on linear orders of size κ. (shrink)

We prove that the statement "For every pair A, B, stationary subsets of ω 2 , composed of points of cofinality ω, there exists an ordinal α such that both A ∩ α and $B \bigcap \alpha$ are stationary subsets of α" is equiconsistent with the existence of weakly compact cardinal. (This completes results of Baumgartner and Harrington and Shelah.) We also prove, assuming the existence of infinitely many supercompact cardinals, the statement "Every stationary subset of ω ω + 1 (...) has a stationary initial segment.". (shrink)

We present a survey of combinatorial set theory relevant to the study of singular cardinals and their successors. The topics covered include diamonds, squares, club guessing, forcing axioms, and PCF theory.

We show that if κ is a weakly compact cardinal then the embeddability relation on trees of size κ is invariantly universal. This means that for every analytic quasi-order R on the generalized Cantor space View the MathML source there is an Lκ+κ-sentence φ such that the embeddability relation on its models of size κ, which are all trees, is Borel bi-reducible to R. In particular, this implies that the relation of embeddability on trees of size κ is complete for (...) analytic quasi-orders on View the MathML source. These facts generalize analogous results for κ=ω obtained in Louveau and Rosendal [17] and Friedman and Motto Ros [6], and it also partially extends a result from Baumgartner [3] concerning the structure of the embeddability relation on linear orders of size κ. (shrink)

The history of productivity of the κ-chain condition in partial orders, topological spaces, or Boolean algebras is surveyed, and its connection to the set-theoretic notion of a weakly compact cardinal is highlighted. Then, it is proved that for every regular cardinal κ > א1, the principle □ is equivalent to the existence of a certain strong coloring c : [κ]2 → κ for which the family of fibers T is a nonspecial κ-Aronszajn tree. The theorem follows from an analysis of (...) a new characteristic function for walks on ordinals, and implies in particular that if the κ-chain condition is productive for a given regular cardinal κ > א1, then κ is weakly compact in some inner model of ZFC. This provides a partial converse to the fact that if κ is a weakly compact cardinal, then the κ-chain condition is productive. (shrink)

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)

Viale introduced covering matrices in his proof that SCH follows from PFA. In the course of the proof and subsequent work with Sharon, he isolated two reflection principles, CP and S, which, under certain circumstances, are satisfied by all covering matrices of a certain shape. Using square sequences, we construct covering matrices for which CP and S fail. This leads naturally to an investigation of square principles intermediate between □κ and □ for a regular cardinal κ. We provide a detailed (...) picture of the implications between these square principles. (shrink)

We will show it is consistent with GCH that there is a minimal non-σ-scattered linear order which does not contain any real or Aronszajn type. In particular the assumption PFA+ in the main result of [5] is necessary, and there are other obstructions than real and Aronszajn types to the sharpness of Laver’s theorem in [8].

We improve the upper bound for the consistency strength of stationary reflection at successors of singular cardinals.

Assume ZFC + "There is a weakly compact cardinal" is consistent. Then: (i) For every $S \subseteq \omega, \mathrm{ZFC} +$ "S and the monadic theory of ω 2 are recursive each in the other" is consistent; and (ii) ZFC + "The full second-order theory of ω 2 is interpretable in the monadic theory of ω 2 " is consistent.

It is proven that the following statement: "there exists a club $C \subseteq \kappa$ such that every α ∈ C is an inaccessible cardinal in L and, for every δ a limit point of C, C ∩ δ is almost contained in every club of δ of L" is equiconsistent with a weakly compact cardinal if κ = ℵ 1 , and with a weakly compact cardinal of order 1 if κ = ℵ 2.

We obtain very strong coloring theorems at successors of singular cardinals from failures of certain instances of simultaneous reflection of stationary sets. In particular, the simplest of our results establishes that if μ is singular and , then there is a regular cardinal θ<μ such that any fewer than cf stationary subsets of must reflect simultaneously.