On the Strong Completeness of Åqvist’s Dyadic Deontic Logic G

  • Xavier Parent
Conference paper

DOI: 10.1007/978-3-540-70525-3_15

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5076)
Cite this paper as:
Parent X. (2008) On the Strong Completeness of Åqvist’s Dyadic Deontic Logic G. In: van der Meyden R., van der Torre L. (eds) Deontic Logic in Computer Science. DEON 2008. Lecture Notes in Computer Science, vol 5076. Springer, Berlin, Heidelberg

Abstract

Åqvist’s dyadic deontic logic G, which aims at providing an axiomatic characterization of Hansson’s seminal system DSDL3 for conditional obligation, is shown to be strongly complete with respect to its intended modelling.

Keywords

Conditional obligation preference-based semantics strong completeness DSDL3 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Xavier Parent
    • 1
  1. 1. ToulonFrance

Personalised recommendations