Abstract
AbstractStable 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öwenheim–Skolem theorem and the Łoś–Vaught test for many-sorted logic.
Publisher
Springer Nature Switzerland
Reference24 articles.
1. Barbosa, H., et al.: cvc5: a versatile and industrial-strength SMT solver. In: TACAS (1). Lecture Notes in Computer Science, vol. 13243, pp. 415–442. Springer, Munich (2022)
2. Barrett, C., Fontaine, P., Tinelli, C.: The SMT-LIB Standard: Version 2.6. Tech. rep., Department of Computer Science, The University of Iowa (2017).http://smt-lib.org
3. Barrett, C., Tinelli, C.: Satisfiability modulo theories. In: Clarke, E.M., Henzinger, T.A., Veith, H., Bloem, R. (eds.) Handbook of Model Checking, pp. 305–343. Springer, New York (2018). https://doi.org/10.1007/978-3-319-10575-8_11, http://theory.stanford.edu/~barrett/pubs/BT18.pdf
4. Casal, F., Rasga, J.a.: Many-sorted equivalence of shiny and strongly polite theories. J. Automat. Reason. 60(2), 221–236 (2018)
5. Ehrenfeucht, A., Mostowski, A.: Models of axiomatic theories admitting automorphisms. Fund. Math. 43, 50–68 (1956)