Strong Completeness of Coalgebraic Modal Logics

Strong Completeness of Coalgebraic Modal Logics
复制标题

代数模态逻辑的强完备性

DOI:
--
复制
发表时间:
2009
期刊:
Symposium on Theoretical Aspects of Computer Science
影响因子:
--
通讯作者:
D. Pattinson
D. Pattinson
中科院分区:
--
文献类型:
--
作者:
Lutz Schröder;D. Pattinson

文献摘要

被引文献

相似文献

规范模型在模态逻辑中具有核心重要性,特别是因为它们证明了强完备性和紧性。虽然规范模型的构造对于Kripke语义是很好理解的,但非正规模态逻辑通常存在微妙的困难-直到规范模型可能不存在的程度,例如在大多数概率逻辑中就是这种情况。在这里,我们提出了一个通用的规范模型建设的语义框架的共代数模态逻辑,它精确定位的语法和语义之间的一致性条件,保证强完备性的模态逻辑。我们应用这种方法来重建典型的模型定理,无论是已知的或民间传说,而且实例化我们的方法,以获得新的强完备性结果。特别是,我们证明了强完备性的分次模态逻辑与有限的多重性,模态逻辑的精确概率。
Canonical models are of central importance in modal logic, in particular as they witness strong completeness and hence compactness. While the canonical model construction is well understood for Kripke semantics, non-normal modal logics often present subtle difficulties - up to the point that canonical models may fail to exist, as is the case e.g. in most probabilistic logics. Here, we present a generic canonical model construction in the semantic framework of coalgebraic modal logic, which pinpoints coherence conditions between syntax and semantics of modal logics that guarantee strong completeness. We apply this method to reconstruct canonical model theorems that are either known or folklore, and moreover instantiate our method to obtain new strong completeness results. In particular, we prove strong completeness of graded modal logic with finite multiplicities, and of the modal logic of exact probabilities.