A complete and compact propositional deontic logic

  • Authors:
  • Pablo F. Castro;T. S. E. Maibaum

  • Affiliations:
  • McMaster University, Department of Computing & Software, Hamilton, Canada;McMaster University, Department of Computing & Software, Hamilton, Canada

  • Venue:
  • ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.