A Complete and Compact Propositional Deontic Logic

DOI10.1007/978-3-540-75292-9_8MaRDI QIDQ3525078zbMATH OpenOpenAlexFDO

Authors Pablo F. Castro, Tim Maibaum

Publication date 17 September 2008

Published in Theoretical Aspects of Computing – ICTAC 2007 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-75292-9_8

zbMATH Keywords

deontic logicfault tolerancemodal logictemporal logicsoftware specification

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Temporal logic (03B44) Logic in computer science (03B70)

Recommendations

• Deontic action logic, atomic Boolean algebras and fault-tolerance
• A Tableaux System for Deontic Action Logic
• A Complete and Decidable Axiomatisation for Deontic Interpreted Systems
• Logical approaches to deontic reasoning: From basic questions to dynamic solutions
• Propositional Quantifiers in Deontic Logic

Cited in

(12)

• Deontic action logic, atomic Boolean algebras and fault-tolerance
• $\mathcal{CL}$ : An Action-Based Logic for Reasoning about Contracts
• Challenges in the Specification of Full Contracts
• A dynamic deontic logic for complex contracts
• Completeness of Åqvist's systems E and F
• Mīmāṃsā Deontic Logic: Proof Theory and Applications
• A Complete and Decidable Axiomatisation for Deontic Interpreted Systems
• scientific article; zbMATH DE number 3847362 (Why is no real title available?)
• A Tableaux System for Deontic Action Logic
• Maximality vs. optimality in dyadic deontic logic. Completeness results for systems in Hansson's tradition
• Reasoning about System-Degradation and Fault-Recovery with Deontic Logic
• Deontic logic, contrary to duty reasoning and fault tolerance

This page was built for publication: A Complete and Compact Propositional Deontic Logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3525078)