2000 character limit reached
Faithful Semantical Embedding of a Dyadic Deontic Logic in HOL
Published 23 Feb 2018 in cs.AI, cs.LO, and math.LO | (1802.08454v2)
Abstract: A shallow semantical embedding of a dyadic deontic logic by Carmo and Jones in classical higher-order logic is presented. This embedding is proven sound and complete, that is, faithful. The work presented here provides the theoretical foundation for the implementation and automation of dyadic deontic logic within off-the-shelf higher-order theorem provers and proof assistants.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
