We prove that for every singular cardinal μ of cofinality ω, the complete Boolean algebra contains a complete subalgebra which is isomorphic to the collapse algebra CompCol. Consequently, adding a generic filter to the quotient algebra collapses μ0 to 1. Another corollary is that the Baire number of the space U of all uniform ultrafilters over μ is equal to ω2. The corollaries affirm two conjectures of Balcar and Simon. The proof uses pcf theory.

We survey the use of club guessing and other PCF constructs in the context of showing that a given partially ordered class of objects does not have a largest, or a universal, element.

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 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)

This paper investigates a connection between the semantic notion provided by the ordering * among theories in model theory and the syntactic SOPn hierarchy of Shelah. It introduces two properties which are natural extensions of this hierarchy, called SOP2 and SOP1. It is shown here that SOP3 implies SOP2 implies SOP1. In Shelah's article 229) it was shown that SOP3 implies *-maximality and we prove here that *-maximality in a model of GCH implies a property called SOP2″. It has been (...) subsequently shown by Shelah and Usvyatsov that SOP2″ and SOP2 are equivalent, so obtaining an implication between *-maximality and SOP2. It is not known if SOP2 and SOP3 are equivalent. Together with the known results about the connection between the SOPn hierarchy and the existence of universal models in the absence of GCH, the paper provides a step toward the classification of unstable theories without the strict order property. (shrink)

We explore Shelah's model‐theoretic dividing line methodology. In particular, we discuss how problems in model theory motivated new techniques in model theory, for example classifying theories by their potential (consistently with Zermelo–Fraenkel set theory with the axiom of choice (ZFC)) spectrum of cardinals in which there is a universal model. Two other examples are the study (with Malliaris) of the Keisler order leading to a new ZFC result on cardinal invariants and attempts to clarify the “main gap” by reducing the (...) dependence of certain versions on (highly independent) cardinal arithmetic. (shrink)

We prove that it is consistent that there exists a saturated tail club guessing ideal on ω1 which is not a restriction of the non-stationary ideal. Two proofs are presented. The first one uses a new forcing axiom whose consistency can be proved from a supercompact cardinal. The resulting model can satisfy either CH or 20=2. The second one is a direct proof from a Woodin cardinal, which gives a witnessing model with CH.

We deal with the existence of universal members in a given cardinality for several classes. First, we deal with classes of abelian groups, specifically with the existence of universal members in cardinalities which are strong limit singular of countable cofinality or λ=λℵ0. We use versions of being reduced—replacing Q by a subring —and get quite accurate results for the existence of universals in a cardinal, for embeddings and for pure embeddings. Second, we deal with the oak property, a property of (...) complete first-order theories sufficient for the nonexistence of universal models under suitable cardinal assumptions. Third, we prove that the oak property holds for the class of groups and deals more with the existence of universals. (shrink)

Countable homogeneous relational structures have been studied by many people. One area of focus is the Ramsey theory of such structures. After a review of background material, a partition theorem of Laflamme, Sauer, and Vuksanovic for countable homogeneous binary relational structures is discussed with a focus on the size of the set of unavoidable colors.

This paper will examine universality spectra for relational theories which cannot be described in first-order logic. We will give a method using functors to show that two types of structures have the same universality spectrum. A combination of methods will be used to show universality results for certain ordered structures and graphs. In some cases, a universal spectrum under GCH will be obtained. Since the theories are not first-order, the classic model theory result under GCH does not hold.

We introduce the oak property of first order theories, which is a syntactical condition that we show to be sufficient for a theory not to have universal models in cardinality λ when certain cardinal arithmetic assumptions about λ implying the failure of GCH hold. We give two examples of theories that have the oak property and show that none of these examples satisfy SOP4, not even SOP3. This is related to the question of the connection of the property SOP4 to (...) non-universality, as was raised by the earlier work of Shelah. One of our examples is the theory for which non-universality results similar to the ones we obtain are already known; hence we may view our results as an abstraction of the known results from a concrete theory to a class of theories. We show that no theory with the oak property is simple. (shrink)

Suppose that λ=λ <λ ≥ℵ0, and we are considering a theory T. We give a criterion on T which is sufficient for the consistent existence of λ++ universal models of T of size λ+ for models of T of size ≤λ+, and is meaningful when 2λ +>λ++. In fact, we work more generally with abstract elementary classes. The criterion for the consistent existence of universals applies to various well known theories, such as triangle-free graphs and simple theories. Having in mind (...) possible applications in analysis, we further observe that for such λ, for any fixed μ>λ+ regular with μ=μλ+, it is consistent that 2λ=μ and there is no normed vector space over ℚ of size <μ which is universal for normed vector spaces over ℚ of dimension λ+ under the notion of embedding h which specifies (a,b) such that ||h(x)/||x∈(a,b) for all x. (shrink)