Is Free Choice Permission Admissible in Classical Deontic Logic?

May 19, 2019 ยท The Ethereal ยท ๐Ÿ› International Workshop on Deontic Logic in Computer Science

๐Ÿ”ฎ THE ETHEREAL: The Ethereal
Pure theory โ€” exists on a plane beyond code

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Guido Governatori, Antonino Rotolo arXiv ID 1905.07696 Category cs.LO: Logic in CS Cross-listed cs.AI, cs.MA Citations 4 Venue International Workshop on Deontic Logic in Computer Science Last Checked 5 months ago
Abstract
In this paper, we explore how, and if, free choice permission (FCP) can be accepted when we consider deontic conflicts between certain types of permissions and obligations. As is well known, FCP can license, under some minimal conditions, the derivation of an indefinite number of permissions. We discuss this and other drawbacks and present six Hilbert-style classical deontic systems admitting a guarded version of FCP. The systems that we present are not too weak from the inferential viewpoint, as far as permission is concerned, and do not commit to weakening any specific logic for obligations.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Logic in CS