Most(?) theories have Borel complete reducts
Logic
2021-09-21 v2
Abstract
We prove that many seemingly simple theories have Borel complete reducts. Specifically, if a countable theory has uncountably many complete 1-types, then it has a Borel complete reduct. Similarly, if is not small, then has a Borel complete reduct, and if a theory is not -stable, then the elementary diagram of some countable model of has a Borel complete reduct.
Cite
@article{arxiv.2103.09724,
title = {Most(?) theories have Borel complete reducts},
author = {Michael C. Laskowski and Douglas S. Ulrich},
journal= {arXiv preprint arXiv:2103.09724},
year = {2021}
}
Comments
Accepted version, will appear in Journal of Symbolic Logic. Typos fixed