Keisler's order is not simple (and simple theories may not be either)
From MaRDI portal
Publication:2237409
DOI10.1016/j.aim.2021.108036OpenAlexW3202571518MaRDI QIDQ2237409
Saharon Shelah, Maryanthe Malliaris
Publication date: 27 October 2021
Published in: Advances in Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1906.10241
Related Items
NOTES ON THE STABLE REGULARITY LEMMA ⋮ Some simple theories from a Boolean algebra point of view ⋮ The Keisler order in continuous logic ⋮ THE TURING DEGREES AND KEISLER’S ORDER
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Independence, order, and the interaction of ultrafilters and theories
- A variant of the hypergraph removal lemma
- Existence of optimal ultrafilters and the fundamental complexity of simple theories
- Realization of \(\varphi \)-types and Keisler's order
- Classification theory and the number of non-isomorphic models.
- Model theory.
- On \(\vartriangleleft^{*}\)-maximality.
- Keisler's order has infinitely many classes
- A new look at interpretability and saturation
- A dividing line within simple unstable theories
- Hypergraph regularity and the multidimensional Szemerédi theorem
- The characteristic sequence of a first-order formula
- An example of a new simple theory
- Cofinality spectrum theorems in model theory, set theory, and general topology
- Zero-One Laws for Sparse Random Graphs
- KEISLER’S ORDER IS NOT LINEAR, ASSUMING A SUPERCOMPACT
- Stable arithmetic regularity in the finite field model
- Paths in graphs
- Set Theory
- MODEL THEORY AND ULTRAPRODUCTS
- Saturating the Random Graph with an Independent Family of Small Range
- Open problems on ultrafilters and some connections to the continuum
- The hypergraph regularity method and its applications
- Hypergraph sequences as a tool for saturation of ultrapowers
- Regularity lemmas for stable graphs
- Some theorems of set theory and their topological consequences
- Ultraproducts which are not saturated
