arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1809.07542cs.LO
收藏

完全可加性与模态不完备性

Complete Additivity and Modal Incompleteness

Wesley H. Holliday, Tadeusz Litak

摘要:

在本文中,我们讲述了一个关于模态逻辑中不完备性的故事。这个故事编织在一起的文件范Bentham,“句法方面的模态不完备性定理,”和一个长期悬而未决的问题:是否每个正常的模态逻辑可以由一类完全加性模态代数,或我们称之为,V-BAO。使用一阶的完全可加性的性质的重新表述,我们证明了模态逻辑,主演的范Bentham的文件解决了开放的问题,在否定的。此外,对于双峰逻辑的情况下,我们表明,有一个自然发生的逻辑是不完整的V-BAO,即可证明性逻辑GLB。我们还表明,即使是不健全的逻辑,就这样的代数不一定要比经典的命题演算更复杂。另一方面,我们观察到,它是不可判定的语法定义的逻辑是否是V-完全的。在这些结果之后,我们将Blok二分法推广到V-不完全度。最后,我们回到van Bentham的主题,模态不完全性的句法方面。

英文摘要:

In this paper, we tell a story about incompleteness in modal logic. The story weaves together a paper of van Benthem, `Syntactic aspects of modal incompleteness theorems,' and a longstanding open question: whether every normal modal logic can be characterized by a class of completely additive modal algebras, or as we call them, V-BAOs. Using a first-order reformulation of the property of complete additivity, we prove that the modal logic that starred in van Benthem's paper resolves the open question in the negative. In addition, for the case of bimodal logic, we show that there is a naturally occurring logic that is incomplete with respect to V-BAOs, namely the provability logic GLB. We also show that even logics that are unsound with respect to such algebras do not have to be more complex than the classical propositional calculus. On the other hand, we observe that it is undecidable whether a syntactically defined logic is V-complete. After these results, we generalize the Blok Dichotomy to degrees of V-incompleteness. In the end, we return to van Benthem's theme of syntactic aspects of modal incompleteness.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑