English

Keisler's Order and Full Boolean-Valued Models

Logic 2018-10-15 v1

Abstract

We prove a compactness theorem for full Boolean-valued models. As an application, we show that if TT is a complete countable theory and B\mathcal{B} is a complete Boolean algebra, then λ+\lambda^+-saturated B\mathcal{B}-valued models of TT exist. Moreover, if U\mathcal{U} is an ultrafilter on TT and M\mathbf{M} is a λ+\lambda^+-saturated B\mathcal{B}-valued model of TT, then whether or not M/U\mathbf{M}/\mathcal{U} is λ+\lambda^+-saturated just depends on U\mathcal{U} and TT; we say that U\mathcal{U} λ+\lambda^+-saturates TT in this case. We show that Keisler's order can be formulated as follows: T0T1T_0 \trianglelefteq T_1 if and only if for every cardinal λ\lambda, for every complete Boolean algebra B\mathcal{B} with the λ+\lambda^+-c.c., and for every ultrafilter U\mathcal{U} on B\mathcal{B}, if U\mathcal{U} λ+\lambda^+-saturates T1T_1, then U\mathcal{U} λ+\lambda^+-saturates T0T_0.

Keywords

Cite

@article{arxiv.1810.05335,
  title  = {Keisler's Order and Full Boolean-Valued Models},
  author = {Douglas Ulrich},
  journal= {arXiv preprint arXiv:1810.05335},
  year   = {2018}
}

Comments

32 pages

R2 v1 2026-06-23T04:37:13.356Z