Constructing regular ultrafilters from a model-theoretic point of view

preprint2012arXivOpen access

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(\aleph_0, \de)$ of ℵ0\aleph_0 modulo $\de$, 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, detected by non-low theories. Assuming κ>ℵ0κ> \aleph_0 is measurable, we construct a regular ultrafilter on λ≥2κλ\geq 2^κ which is flexible (thus: ok) but not good, and which moreover has large $\lcf(\aleph_0)$ but does not even saturate models of the random graph. We prove that there is a loss of saturation in regular ultrapowers of unstable theories, and give a new proof that there is a loss of saturation in ultrapowers of non-simple theories. Finally, 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 SOP2SOP_2. We prove that for any n<ωn < ω, assuming the existence of nn measurable cardinals below λλ, there is a regular ultrafilter DD on λλ such that any DD-ultrapower of a model of linear order will have nn alternations of cuts, as defined below. Moreover, DD will λ+λ^+-saturate all stable theories but will not (2κ)+(2^κ)^+-saturate any unstable theory, where κκ is the smallest measurable cardinal used in the construction.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.