Bringing closure to theory combination properties
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913172117520384 |
|---|---|
| author | Toledo, Guilherme V. Przybocki, Benjamin Zohar, Yoni |
| author_facet | Toledo, Guilherme V. Przybocki, Benjamin Zohar, Yoni |
| contents | We consider the closure of three classical combination properties, namely, stable infiniteness, gentleness and shininess (or, equivalently for decidable theories, strong politeness), under intersection and combinability. We compute every possible intersection, and then compute the maximal set of theories that can be combined with each resulting intersection. We iterate this process until no new sets are identified. How many properties will we end up with? |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_30762 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Bringing closure to theory combination properties Toledo, Guilherme V. Przybocki, Benjamin Zohar, Yoni Logic in Computer Science Logic We consider the closure of three classical combination properties, namely, stable infiniteness, gentleness and shininess (or, equivalently for decidable theories, strong politeness), under intersection and combinability. We compute every possible intersection, and then compute the maximal set of theories that can be combined with each resulting intersection. We iterate this process until no new sets are identified. How many properties will we end up with? |
| title | Bringing closure to theory combination properties |
| topic | Logic in Computer Science Logic |
| url | https://arxiv.org/abs/2605.30762 |