Keisler's order is not simple (and simple theories may not be either)

DOI10.1016/J.AIM.2021.108036OpenAlexW3202571518MaRDI QIDQ2237409FDOQ2237409

Authors: S. Shelah, M. 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

Recommendations

• Keisler's order has infinitely many classes
• An example of a new simple theory
• Toward classifying unstable theories
• The Keisler order in continuous logic
• Keisler's order is not linear, assuming a supercompact

zbMATH Keywords

model theoryregular ultrafilterssimple theoriesKeisler's order

Mathematics Subject Classification ID

Graph theory (05Cxx) Model theory (03Cxx) Set theory (03Exx)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A dividing line within simple unstable theories
• A new look at interpretability and saturation
• A variant of the hypergraph removal lemma
• An example of a new simple theory
• Classification theory and the number of non-isomorphic models.
• Cofinality spectrum theorems in model theory, set theory, and general topology
• Existence of optimal ultrafilters and the fundamental complexity of simple theories
• Hypergraph regularity and the multidimensional Szemerédi theorem
• Hypergraph sequences as a tool for saturation of ultrapowers
• Independence, order, and the interaction of ultrafilters and theories
• Keisler's order has infinitely many classes
• Keisler's order is not linear, assuming a supercompact
• MODEL THEORY AND ULTRAPRODUCTS
• Model theory.
• On \(\vartriangleleft^{*}\)-maximality.
• Open problems on ultrafilters and some connections to the continuum
• Paths in graphs
• Realization of \(\varphi \)-types and Keisler's order
• Regularity lemmas for stable graphs
• Saturating the random graph with an independent family of small range
• Set Theory
• Some theorems of set theory and their topological consequences
• Stable arithmetic regularity in the finite field model
• The characteristic sequence of a first-order formula
• The hypergraph regularity method and its applications
• The ultraproduct construction
• Ultraproducts which are not saturated
• Zero-One Laws for Sparse Random Graphs

Cited In (7)

• Shearing in some simple rank one theories
• New simple theories from hypergraph sequences
• Keisler's order is not simple (and simple theories may not be either)
• Some simple theories from a Boolean algebra point of view
• THE TURING DEGREES AND KEISLER’S ORDER
• The Keisler order in continuous logic
• NOTES ON THE STABLE REGULARITY LEMMA

This page was built for publication: Keisler's order is not simple (and simple theories may not be either)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2237409)