Skip Navigation



Logic Journal of IGPL Advance Access published online on September 9, 2009
Logic Journal of IGPL, doi:10.1093/jigpal/jzp050
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Parent, X.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author 2009. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

A complete axiom set for Hansson's deontic logic DSDL2

Xavier Parent

Individual and Collective Reasoning Group, Department of Computer Science and Communications, University of Luxembourg.
E-mail: xavier.parent{at}uni.lu


  Abstract

The main contribution of this paper is a (strong) completeness result for an axiomatization of Hansson [13]'s deontic system DSDL2, whose semantics involves a non-necessarily transitive betterness relation. Reference is made to a deductive system put forth by Åqvist [2, 3].

Key Words: deontic logic • completeness • Hansson's system DSDL2 • non-transitive betterness relation • optimality language for dyadic deontic logic

Received for publication 6 September 2008. Revision received 27 June 2009.
Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.