10 citations · 52 across the 22 of their papers we have counts for
19 papers · 1 filter
The unstable formula theorem revisited via algorithms
Maryanthe Malliaris, Shay Moran
This paper is about the surprising interaction of a foundational result from model theory, about stability of theories, with algorithmic stability in learning. First, in response t…
Some simple theories from a Boolean algebra point of view
M. Malliaris, S. Shelah
We find a strong separation between two natural families of simple rank one theories in Keisler's order: the theories reflecting graph sequences, which witness tha…
Notes on the stable regularity lemma
M. Malliaris, S. Shelah
This is a short expository account of the regularity lemma for stable graphs proved by the authors, with some comments on the model theoretic context, written for a general logical…
Keisler's order is not simple (and simple theories may not be either)
M. Malliaris, S. Shelah
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,…
A separation theorem for simple theories
M. Malliaris, S. Shelah
This paper builds model-theoretic tools to detect changes in complexity among the simple theories. We develop a generalization of dividing, called shearing, which depends on a so-c…
An example of a new simple theory
M. Malliaris, S. Shelah
We construct a countable simple theory which, in Keisler's order, is strictly above the random graph (but "barely so") and also in some sense orthogonal to the building blocks of t…