论文标题
关于由确定性框架类别确定的模态逻辑的统一类型
About the unification types of the modal logics determined by classes of deterministic frames
论文作者
论文摘要
命题逻辑中的统一问题是确定给定式f，是否存在替换，以使s（f）具有该逻辑。在这种情况下，S是F的Unifier。当统一公式的完整统一器集最少时，该公式是无限，限制性的，或者是单一的，具体取决于其最小完整的统一器的基数。在本文中，我们研究了由确定性框架类别确定的一些模态逻辑的统一类型。
The unification problem in a propositional logic is to determine, given a formula F, whether there exists a substitution s such that s(F) is in that logic. In that case, s is a unifier of F. When a unifiable formula has minimal complete sets of unifiers, the formula is either infinitary, finitary, or unitary, depending on the cardinality of its minimal complete sets of unifiers. In this paper, we study the unification types of some modal logics determined by classes of deterministic frames.
