On regular reduced products

Abstract. This paper contributes to the set-theoretic side of understanding Keisler's order. We consider properties of ultrafilters which affect saturation of unstable theories: the lower cofinality lcf(ℵ0, D) of ℵ0 modulo D, saturation of the minimum unstable theory (the random graph), flexibility, goodness, goodness for equality, and realization of symmetric cuts. We work in ZFC except when noted, as several constructions appeal to complete ultrafilters thus assume a measurable cardinal. The main results are as follows. First, we investigate the strength of flexibility, known to be detected by non-low theories. Assuming κ > ℵ0 is measurable, we construct a regular ultrafilter on λ ≥ 2 κ which is flexible but not good, and which moreover has large lcf(ℵ0) but does not even saturate models of the random graph. This implies (a) that flexibility alone cannot characterize saturation of any theory, however (b) by separating flexibility from goodness, we remove a main obstacle to proving non-low does not imply maximal. Since flexible is precisely OK, this also shows that (c) from a set-theoretic point of view, consistently, ok need not imply good, addressing a problem from Dow 1985. Second, under no additional assumptions, we prove that there is a loss of saturation in regular ultrapowers of unstable theories, and also give a new proof that there is a loss of saturation in ultrapowers of non-simple theories. More precisely, for D regular on κ and M a model of an unstable theory, M κ /D is not (2 κ ) + -saturated; and for M a model of a non-simple theory and λ = λ <λ , M λ /D is not λ ++ -saturated. In the third part of the paper, we investigate realization and omission of symmetric cuts, significant both because of the maximality of the strict order property in Keisler's order, and by recent work of the authors on SOP2. We prove that if D is a κ-complete ultrafilter on κ, any ultrapower of a sufficiently saturated model of linear order will have no (κ, κ)-cuts, and that if D is also normal, it will have a (κ + , κ + )-cut. We apply this to prove that for any n < ω, assuming the existence of n measurable cardinals below λ, there is a regular ultrafilter D on λ such that any D-ultrapower of a model of linear order will have n alternations of cuts, as defined below. Moreover, D will λ + -saturate all stable theories but will not (2 κ ) + -saturate any unstable theory, where κ is the smallest measurable cardinal used in the construction.

show abstract

“…Fact 8.4. Suppose that D is a regular ultrafilter on λ, λ = λ <λ or just (ℵ 1 , ℵ 0 ) → (λ + , λ) (see [6]). Let κ = ℵ 0 .…”

Section: λ /D Is Not λ ++ -Saturated For λ Regular and T H(m ) Non-mentioning

confidence: 99%

Constructing regular ultrafilters from a model-theoretic point of view

Malliaris

Shelah

2015

Trans. Amer. Math. Soc.

View full text Add to dashboard Cite

show abstract

“…Let h(n, m) = the total number of nonequivalent Diophantine formulas For a result concerning arbitrary structures and other cardinals, see [4].…”

Section: The Uncountable Casementioning

confidence: 99%

“…Let n 0 be such that n ≥ n 0 implies |u β n |/n < 1/2. Then we set In [4] models of higher cardinality are considered, and embedding theorems are obtained under a set-theoretic assumption.…”

Section: The Uncountable Casementioning

confidence: 99%

On embedding models of arithmetic of cardinality \aleph₁into reduced powers

Kennedy

Shelah

2003

Fund. Math.

Self Cite

View full text Add to dashboard Cite

show abstract

“…With our present result we give a partial solution to the mentioned problem of Chang-Keisler under weaker assumptions than V = L. Around the importance of the cardinality of the language see [9].…”

Section: Uncountable Languagesmentioning

confidence: 79%