English

Model-theoretic applications of cofinality spectrum problems

Logic 2015-03-31 v1

Abstract

We apply the recently developed technology of cofinality spectrum problems to prove a range of theorems in model theory. First, we prove that any model of Peano arithmetic is λ\lambda-saturated iff it has cofinality λ\geq \lambda and the underlying order has no (κ,κ)(\kappa, \kappa)-cuts for regular κ<λ\kappa < \lambda. Second, assuming instances of GCH, we prove that SOP2SOP_2 characterizes maximality in the interpretability order \trianglelefteq^*, settling a prior conjecture and proving that SOP2SOP_2 is a real dividing line. Third, we establish the beginnings of a structure theory for NSOP2NSOP_2, proving that NSOP2NSOP_2 can be characterized by the existence of few inconsistent higher formulas. In the course of the paper, we show that ps=ts\mathfrak{p}_s = \mathfrak{t}_s in any weak cofinality spectrum problem closed under exponentiation (naturally defined). We also prove that the local versions of these cardinals need not coincide, even in cofinality spectrum problems arising from Peano arithmetic.

Keywords

Cite

@article{arxiv.1503.08338,
  title  = {Model-theoretic applications of cofinality spectrum problems},
  author = {M. Malliaris and S. Shelah},
  journal= {arXiv preprint arXiv:1503.08338},
  year   = {2015}
}
R2 v1 2026-06-22T09:04:36.245Z