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 is a complete countable theory and is a complete Boolean algebra, then -saturated -valued models of exist. Moreover, if is an ultrafilter on and is a -saturated -valued model of , then whether or not is -saturated just depends on and ; we say that -saturates in this case. We show that Keisler's order can be formulated as follows: if and only if for every cardinal , for every complete Boolean algebra with the -c.c., and for every ultrafilter on , if -saturates , then -saturates .
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