A Complete and Compact Propositional Deontic Logic
A Complete and Compact Propositional Deontic Logic
复制标题
完整而紧凑的命题道义逻辑
DOI：
--
复制
发表时间：
2007
期刊：
影响因子：
--
通讯作者：
Tom Maibaum
中科院分区：
文献类型：
--
作者：
Pablo F. Castro;Tom Maibaum
在本文中，我们提出了一个命题道义逻辑，目的是用它来指定容错系统，并给出了它的公理化。我们证明了该逻辑的完备性、健全性、紧性和可决性。完备性证明过程中使用的主要技术是基于模态逻辑的标准技术，但在处理模态逻辑时引入了一些新的特性。此外，该逻辑还提供了一些在实践中有用的运算符，特别是在对容错系统建模和对其容错属性进行推理时。
In this paper we present a propositional deontic logic, with the goal of using it to specify fault-tolerant systems, and an axiomatization of it. We prove several results about this logic: completeness, soundness, compactness and decidability. The main technique used during the completeness proof is based on standard techniques for modal logics, but it has some new characteristics introduced for dealing with this logic. In addition, the logic provides several operators which appear useful for use in practice, in particular to model fault-tolerant systems and to reason about their fault tolerance properties.