Being polite is not enough (and other limits of theory combination)
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866910958527447040 |
|---|---|
| author | Toledo, Guilherme V. Przybocki, Benjamin Zohar, Yoni |
| author_facet | Toledo, Guilherme V. Przybocki, Benjamin Zohar, Yoni |
| contents | In the Nelson-Oppen combination method for satisfiability modulo theories, the combined theories must be stably infinite; in gentle combination, one theory has to be gentle, and the other has to satisfy a similar yet weaker property; in shiny combination, only one has to be shiny (smooth, with a computable minimal model function and the finite model property); and for polite combination, only one has to be strongly polite (smooth and strongly finitely witnessable). For each combination method, we prove that if any of its assumptions are removed, then there is no general method to combine an arbitrary pair of theories satisfying the remaining assumptions. We also prove new theory combination results that weaken the assumptions of gentle and shiny combination. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_04870 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Being polite is not enough (and other limits of theory combination) Toledo, Guilherme V. Przybocki, Benjamin Zohar, Yoni Logic in Computer Science Logic In the Nelson-Oppen combination method for satisfiability modulo theories, the combined theories must be stably infinite; in gentle combination, one theory has to be gentle, and the other has to satisfy a similar yet weaker property; in shiny combination, only one has to be shiny (smooth, with a computable minimal model function and the finite model property); and for polite combination, only one has to be strongly polite (smooth and strongly finitely witnessable). For each combination method, we prove that if any of its assumptions are removed, then there is no general method to combine an arbitrary pair of theories satisfying the remaining assumptions. We also prove new theory combination results that weaken the assumptions of gentle and shiny combination. |
| title | Being polite is not enough (and other limits of theory combination) |
| topic | Logic in Computer Science Logic |
| url | https://arxiv.org/abs/2505.04870 |