Characterizing Sets of Theories That Can Be Disjointly Combined
Benjamin Przybocki, Guilherme Vicentin de Toledo, Yoni Zohar
Abstract
We study properties that allow first-order theories to be disjointly combined, including stable infiniteness, shininess, strong politeness, and gentleness. Specifically, we describe a Galois connection between sets of decidable theories, which picks out the largest set of decidable theories that can be combined with a given set of decidable theories. Using this, we exactly characterize the sets of decidable theories that can be combined with those satisfying well-known theory combination properties. This strengthens previous results and answers in the negative several long-standing open questions about the possibility of improving existing theory combination methods to apply to larger sets of theories. Additionally, the Galois connection gives rise to a complete lattice of theory combination properties, which allows one to generate new theory combination methods by taking meets and joins of elements of this lattice. We provide examples of this process, introducing new combination theorems. We situate both new and old combination methods within this lattice.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 5785897c-3f0b-4b09-8ecc-c421d818ba62Builds on2
- Solving string constraints with Regex-dependent functions through transducers with priorities and variablesTaolue Chen, Alejandro Flores-Lamas, Matthew Hague, Zhilei Han et al.POPL 2022 · 39 citations
- The Nonexistence of Unicorns and Many-Sorted Löwenheim-Skolem TheoremsBenjamin Przybocki, Guilherme Vicentin de Toledo, Yoni Zohar, Clark W. BarrettFM 2024 · 4 citations
Related papers
- On the Expressive Power of String ConstraintsJoel D. Day, Vijay Ganesh, Nathan Grewal, Florin ManeaPOPL 2023 · 11 citations
- Logics for Sizes with Union or IntersectionCaleb Kisby, Saúl A. Blanco, Alex Kruckman, Lawrence S. MossAAAI 2020 · 2 citations
- Generalized Decidability via Brouwer TreesTom de Jong, Nicolai Kraus, Aref Mohammadzadeh, Fredrik Nordvall ForsbergLICS 2026
- On Action Theories with Iterable First-Order ProgressionDaxin Liu, Jens ClaßenAAAI 2025 · 1 citation
- Parameterized Logical TheoriesFangzhen LinAAAI 2021
