Shininess, strong politeness, and unicorns
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912468604813312 |
|---|---|
| author | Przybocki, Benjamin Toledo, Guilherme V. Zohar, Yoni |
| author_facet | Przybocki, Benjamin Toledo, Guilherme V. Zohar, Yoni |
| contents | Shininess and strong politeness are properties related to theory combination procedures. In a paper titled "Many-sorted equivalence of shiny and strongly polite theories", Casal and Rasga proved that for decidable theories, these properties are equivalent. We refine their result by showing that: (i) shiny theories are always decidable, and therefore strongly polite; and (ii) there are (undecidable) strongly polite theories that are not shiny. This line of research is tightly related to a recent series of papers that have sought to classify all the relations between theory combination properties. We finally complete this project, resolving all of the remaining problems that were previously left open. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_04445 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Shininess, strong politeness, and unicorns Przybocki, Benjamin Toledo, Guilherme V. Zohar, Yoni Logic in Computer Science Logic Shininess and strong politeness are properties related to theory combination procedures. In a paper titled "Many-sorted equivalence of shiny and strongly polite theories", Casal and Rasga proved that for decidable theories, these properties are equivalent. We refine their result by showing that: (i) shiny theories are always decidable, and therefore strongly polite; and (ii) there are (undecidable) strongly polite theories that are not shiny. This line of research is tightly related to a recent series of papers that have sought to classify all the relations between theory combination properties. We finally complete this project, resolving all of the remaining problems that were previously left open. |
| title | Shininess, strong politeness, and unicorns |
| topic | Logic in Computer Science Logic |
| url | https://arxiv.org/abs/2507.04445 |