2019/05/19 by Guido Governatori, Governatori, Guido, Antonino Rotolo +1
Computer Science · Mathematics · #Advanced Algebra and Logic #Artificial Intelligence (cs.AI) #Computer science #Deontic logic #Economics #Epistemology #FOS: Computer and information sciences #Law and economics #Logic in Computer Science (cs.LO) #Logic, Reasoning, and Knowledge #Logic, programming, and type systems #Mathematical economics #Mathematics #Multiagent Systems (cs.MA) #Permission #Philosophy #cs.AI #cs.LO #cs.MA
paper · pdf · doi:10.48550/arxiv.1905.07696
openalex publication_date 2019/05/19 · arxiv created 2019/06/10 · arxiv updated 2019/06/11 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.