Saturating the random graph with an independent family of small range

preprint2012arXivOpen access

Abstract

Motivated by Keisler's order, a far-reaching program of understanding basic model-theoretic structure through the lens of regular ultrapowers, we prove that for a class of regular filters DD on II, ∣I∣=λ>ℵ0|I| = λ> \aleph_0, the fact that $P(I)/\de$ has little freedom (as measured by the fact that any maximal antichain is of size <λ<λ, or even countable) does not prevent extending DD to an ultrafilter D1D_1 on II which saturates ultrapowers of the random graph. "Saturates" means that $M^I/\de_1$ is λ+λ^+-saturated whenever M is a model of the theory of the random graph. This was known to be true for stable theories, and false for non-simple and non-low theories. This result and the techniques introduced in the proof have catalyzed the authors' subsequent work on Keisler's order for simple unstable theories. The introduction, which includes a part written for model theorists and a part written for set theorists, discusses our current program and related results.

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.