Keisler's order via Boolean ultrapowers
Logic
2021-04-08 v2
Abstract
In this paper, we provide a new characterization of Keisler's order in terms of saturation of Boolean ultrapowers. To do so, we apply and expand the framework of 'separation of variables' recently developed by Malliaris and Shelah. We also show that good ultrafilters on Boolean algebras are precisely the ones which capture the maximum class in Keisler's order, answering a question posed by Benda in 1974.
Keywords
Cite
@article{arxiv.1810.09428,
title = {Keisler's order via Boolean ultrapowers},
author = {Francesco Parente},
journal= {arXiv preprint arXiv:1810.09428},
year = {2021}
}