Characterizing Sets of Theories That Can Be Disjointly Combined
By: Benjamin Przybocki, Guilherme V. Toledo, Yoni Zohar
Potential Business Impact:
Makes computer programs work together better.
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.
Similar Papers
Semantic Properties of Computations Defined by Elementary Inference Systems
Logic in Computer Science
Proves computer program rules are correct.
Modelling of logical systems by means of their fragments
Logic in Computer Science
Makes complex logic problems simpler for computers.
Tableau methodology for propositional logics
Logic in Computer Science
Makes logic puzzles easier to solve.