We continue our investigation into using the hybridization technique on top of the many-sorted polyadic modal logic we have previously defined. By adding different operators and binders, we present in this paper several systems we have developed. We briefly discuss the goals we have achieved by developing each system. We identify a fragment of the full hybrid logic, for which we prove its sound and complete deduction and we show that it is powerful enough to represent both the programs and their semantics in an uniform manner. Finally, we provide a standard translation from full hybrid many-sorted logic to first-order logic.

中文翻译：

---

多分类混合模态语言

我们将继续在先前定义的多种多元模态逻辑之上使用杂交技术进行研究。通过添加不同的运算符和联编程序，我们在本文中介绍了已经开发的几种系统。我们简要讨论了通过开发每个系统实现的目标。我们确定了完整混合逻辑的一个片段，对此我们可以证明其合理和完整的推论，并证明它足够强大，可以以统一的方式表示程序及其语义。最后，我们提供了从完全混合的多种逻辑到一阶逻辑的标准转换。