The nonexistence of unicorns and many-sorted L\"owenheim-Skolem theorems
<|reference_start|>The nonexistence of unicorns and many-sorted L\"owenheim-Skolem theorems: Stable infiniteness, strong finite witnessability, and smoothness are model-theoretic properties relevant to theory combination in satisfiability modulo theories. Theories that are strongly finitely witnessable and smooth are called strongly polite and can be effectively combined with other theories. Toledo, Zohar, and Barrett conjectured that stably infinite and strongly finitely witnessable theories are smooth and therefore strongly polite. They called counterexamples to this conjecture unicorn theories, as their existence seemed unlikely. We prove that, indeed, unicorns do not exist. We also prove versions of the L\"owenheim-Skolem theorem and the {\L}o\'s-Vaught test for many-sorted logic.<|reference_end|>
@article{przybocki2024the,
    title={The nonexistence of unicorns and many-sorted L\"owenheim-Skolem theorems},
    author={Benjamin Przybocki, Guilherme Toledo, Yoni Zohar, Clark Barrett},
    journal={arXiv preprint arXiv:2406.18912},
    year={2024},
    archivePrefix={arXiv},
    eprint={2406.18912},
    primaryClass={math.LO cs.LO}
}