Related papers: Keisler's order via Boolean ultrapowers
In this paper we analyse and compare two different notions of regularity for filters on complete Boolean algebras. We also announce two results from a forthcoming paper in preparation, which provide a characterization of Keisler's order in…
We prove a compactness theorem for full Boolean-valued models. As an application, we show that if $T$ is a complete countable theory and $\mathcal{B}$ is a complete Boolean algebra, then $\lambda^+$-saturated $\mathcal{B}$-valued models of…
In the first edition of Classification Theory, the second author characterized the stable theories in terms of saturation of ultrapowers. Prior to this theorem, stability had already been defined in terms of counting types, and the unstable…
We find a strong separation between two natural families of simple rank one theories in Keisler's order: the theories $T_\mathfrak{m}$ reflecting graph sequences, which witness that Keisler's order has the maximum number of classes, and the…
We study two generalizations of the Rudin-Keisler ordering to ultrafilters on complete Boolean algebras. To highlight the difference between them, we develop new techniques to construct incomparable ultrafilters in this setting.…
We prove, in ZFC, that there is an infinite strictly descending chain of classes of theories in Keisler's order. Thus Keisler's order is infinite and not a well order. Moreover, this chain occurs within the simple unstable theories,…
Solving a decades-old problem we show that Keisler's 1967 order on theories has the maximum number of classes. The theories we build are simple unstable with no nontrivial forking, and reflect growth rates of sequences which may be thought…
We give the first (ZFC) dividing line in Keisler's order among the unstable theories, specifically among the simple unstable theories. That is, for any infinite cardinal $\lambda$ for which there is $\mu < \lambda \leq 2^\mu$, we construct…
In 1967 the author introduced a pre-ordering of all first order complete theories where T is lower than U if it is easier for an ultrapower of a model of T than an ultrapower of a model of U to be saturated. In a long series of recent…
Malliaris and Shelah famously proved that Keisler's order $\trianglelefteq$ has infinitely many classes. In more detail, for each $2 \leq k < n < \omega$, let $T_{n, k}$ be the theory of the random $k$-ary $n$-clique free hypergraph.…
We give a model-theoretic perspective on regular ultrafilter construction in the twentieth and twenty-first century (so far), and explain the "canonical Boolean algebra" recently developed by Malliaris and Shelah.
In [1] the authors showed some basic properties of a pre-order that arose in combinatorial number theory, namely the finite embeddability between sets of natural numbers, and they presented its generalization to ultrafilters, which is…
We study various orders on countably complete ultrafilters on ordinals that coincide and are wellorders under a hypothesis called the Ultrapower Axiom. Our main focus is on the relationship between the Ultrapower Axiom and the linearity of…
A theorem due to Kazhdan and Ziegler implies that, by substituting linear forms for its variables, a homogeneous polynomial of sufficiently high strength specialises to any given polynomial of the same degree in a bounded number of…
We study the question which Boolean algebras have the property that for every generating set there is an ultrafilter selecting maximal number of its elements. We call it the ultrafilter selection property. For cardinality aleph-one the…
We develop a theory of higher order structures in compact abelian groups. In the frame of this theory we prove general inverse theorems and regularity lemmas for Gowers's uniformity norms. We put forward an algebraic interpretation of the…
We investigate the structure of ultrafilters on Boolean algebras in the framework of Tukey reducibility. In particular, this paper provides several techniques to construct ultrafilters which are not Tukey maximal. Furthermore, we connect…
We present a new method for constructing $D$-dimensional minimally superintegrable systems based on block coordinate separation of variables. We give two new families of superintegrable systems with $N$ ($N\leq D$) singular terms of the…
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 $\aleph_0$ modulo $\de$,…
An earlier paper, entitled "P-hierarchy on $\beta\omega$", investigated the relations between ordinal ultrafilters and the so-called P-hierarchy. This study is continued in the present paper and focuses on the aspects of characterization of…