Skip to main content
Conference Proceedings

On the strong completeness of Åqvist's dyadic deontic logic G

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2008) 5076 LNAI 189-202
DOI: 10.1007/978-3-540-70525-3_15
7Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

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. © 2008 Springer-Verlag.

Author supplied keywords

Cite

CITATION STYLE

APA

Parent, X. (2008). On the strong completeness of Åqvist’s dyadic deontic logic G. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5076 LNAI, pp. 189–202). https://doi.org/10.1007/978-3-540-70525-3_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free