Abstract
Our results in this paper increase the model-theoretic precision of a widely used method for building ultrafilters, and so advance the general problem of constructing ultrafilters whose ultrapowers have a precise degree of saturation. We begin by showing that any flexible regular ultrafilter makes the product of an unbounded sequence of finite cardinals large, {thus} saturating any stable theory. We then prove directly that a "bottleneck" in the inductive construction of a regular ultrafilter on (i.e. a point after which all antichains of have cardinality less than ) essentially prevents any subsequent ultrafilter from being flexible, {thus} from saturating any non-low theory. The paper's three main constructions are as follows. First, we construct a regular filter on so that any ultrafilter extending fails to -saturate ultrapowers of the random graph, {thus} of any unstable theory. The proof constructs the omitted random graph type directly. Second, assuming existence of a measurable cardinal , we construct a regular ultrafilter on which is -flexible but not -good, improving our previous answer to a question raised in Dow 1975. Third, assuming a weakly compact cardinal , we construct an ultrafilter to show that $\lcf(\aleph_0)$ may be small while all symmetric cuts of cofinality are realized. Thus certain families of pre-cuts may be realized while still failing to saturate any unstable theory.
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.