Shininess, Strong Politeness, and Unicorns

Benjamin Przybocki; Guilherme V. Toledo; Yoni Zohar

doi:10.1007/978-3-032-04167-8_8

Shininess, Strong Politeness, and Unicorns

Benjamin Przybocki
, Guilherme V. Toledo
, Yoni Zohar

Department of Computer Science and Artificial Intelligence

University of Cambridge
Bar-Ilan University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Scopus citations

Abstract

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.

Original language	English
Title of host publication	Frontiers of Combining Systems - 15th International Symposium, FroCoS 2025, Proceedings
Editors	René Thiemann, Christoph Weidenbach
Publisher	Springer Science and Business Media Deutschland GmbH
Pages	135-152
Number of pages	18
ISBN (Print)	9783032041661
DOIs	https://doi.org/10.1007/978-3-032-04167-8_8
State	Published - 2026
Event	15th International Symposium on Frontiers of Combining Systems, FroCoS 2025 - Reykjavik, Iceland Duration: 29 Sep 2025 → 1 Oct 2025

Publication series

Name	Lecture Notes in Computer Science
Volume	15979 LNAI
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	15th International Symposium on Frontiers of Combining Systems, FroCoS 2025
Country/Territory	Iceland
City	Reykjavik
Period	29/09/25 → 1/10/25

Bibliographical note

Publisher Copyright:
© The Author(s) 2026.

Access to Document

10.1007/978-3-032-04167-8_8

Cite this

Przybocki, B., V. Toledo, G., & Zohar, Y. (2026). Shininess, Strong Politeness, and Unicorns. In R. Thiemann, & C. Weidenbach (Eds.), Frontiers of Combining Systems - 15th International Symposium, FroCoS 2025, Proceedings (pp. 135-152). (Lecture Notes in Computer Science; Vol. 15979 LNAI). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-032-04167-8_8

@inproceedings{b51262092f1941f592160ea6bfff1f27,

title = "Shininess, Strong Politeness, and Unicorns",

abstract = "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.",

author = "Benjamin Przybocki and \{V. Toledo\}, Guilherme and Yoni Zohar",

note = "Publisher Copyright: {\textcopyright} The Author(s) 2026.; 15th International Symposium on Frontiers of Combining Systems, FroCoS 2025 ; Conference date: 29-09-2025 Through 01-10-2025",

year = "2026",

doi = "10.1007/978-3-032-04167-8\_8",

language = "אנגלית",

isbn = "9783032041661",

series = "Lecture Notes in Computer Science",

publisher = "Springer Science and Business Media Deutschland GmbH",

pages = "135--152",

editor = "Ren{\'e} Thiemann and Christoph Weidenbach",

booktitle = "Frontiers of Combining Systems - 15th International Symposium, FroCoS 2025, Proceedings",

address = "גרמניה",

}

Przybocki, B, V. Toledo, G & Zohar, Y 2026, Shininess, Strong Politeness, and Unicorns. in R Thiemann & C Weidenbach (eds), Frontiers of Combining Systems - 15th International Symposium, FroCoS 2025, Proceedings. Lecture Notes in Computer Science, vol. 15979 LNAI, Springer Science and Business Media Deutschland GmbH, pp. 135-152, 15th International Symposium on Frontiers of Combining Systems, FroCoS 2025, Reykjavik, Iceland, 29/09/25. https://doi.org/10.1007/978-3-032-04167-8_8

Shininess, Strong Politeness, and Unicorns. / Przybocki, Benjamin; V. Toledo, Guilherme; Zohar, Yoni.
Frontiers of Combining Systems - 15th International Symposium, FroCoS 2025, Proceedings. ed. / René Thiemann; Christoph Weidenbach. Springer Science and Business Media Deutschland GmbH, 2026. p. 135-152 (Lecture Notes in Computer Science; Vol. 15979 LNAI).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Shininess, Strong Politeness, and Unicorns

AU - Przybocki, Benjamin

AU - V. Toledo, Guilherme

AU - Zohar, Yoni

PY - 2026

Y1 - 2026

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/105017115849

U2 - 10.1007/978-3-032-04167-8_8

DO - 10.1007/978-3-032-04167-8_8

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:105017115849

SN - 9783032041661

T3 - Lecture Notes in Computer Science

SP - 135

EP - 152

BT - Frontiers of Combining Systems - 15th International Symposium, FroCoS 2025, Proceedings

A2 - Thiemann, René

A2 - Weidenbach, Christoph

PB - Springer Science and Business Media Deutschland GmbH

T2 - 15th International Symposium on Frontiers of Combining Systems, FroCoS 2025

Y2 - 29 September 2025 through 1 October 2025

ER -