2018•arXiv (Cornell University)Open access

Keisler's Order and Full Boolean-Valued Models

Douglas Ulrich

Open full text 3 citations

Abstract

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

Open-access reader

About this research paper

What this paper is about

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

Why it matters

OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

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

Key concepts: Ultrafilter, Lambda, Boolean algebra, Order (exchange), Combinatorics, Complete Boolean algebra, Countable set, Mathematics

Related papers

Back to paper searchBrowse research topicsOriginal source
Keisler's Order and Full Boolean-Valued Models — Research Paper | ScholarLens