光泽性、强礼貌性与独角兽
Shininess, strong politeness, and unicorns
AI总结：
本文细化光泽性与强礼貌性理论组合性质的关系，证明光泽理论必可判定且强礼貌，并构造不可判定但强礼貌的非光泽理论，最终完成理论组合性质关系的完整分类。
摘要：
光泽性与强礼貌性是与理论组合过程相关的性质。在题为“光泽理论与强礼貌理论的多类等价性”的论文中，Casal 和 Rasga 证明了对于可判定理论，这些性质是等价的。我们通过证明以下两点来细化他们的结果：(i) 光泽理论总是可判定的，因此也是强礼貌的；(ii) 存在（不可判定的）强礼貌理论但不是光泽的。这一研究方向与最近一系列试图分类理论组合性质之间所有关系的论文密切相关。我们最终完成了这一项目，解决了此前遗留的所有未决问题。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
