M\=im\=a\d{m}s\=a deontic logic: proof theory and applications
Logic in Computer Science
2017-05-10 v1
Abstract
Starting with the deontic principles in M\={\i}m\=a\d{m}s\=a texts we introduce a new deontic logic. We use general proof-theoretic methods to obtain a cut-free sequent calculus for this logic, resulting in decidability, complexity results and neighbourhood semantics. The latter is used to analyse a well known example of conflicting obligations from the Vedas.
Cite
@article{arxiv.1705.03211,
title = {M\=im\=a\d{m}s\=a deontic logic: proof theory and applications},
author = {Agata Ciabattoni and Elisa Freschi and Francesco A. Genco and Björn Lellmann},
journal= {arXiv preprint arXiv:1705.03211},
year = {2017}
}
Comments
16 pages, published in the proceedings of Automated Reasoning with Analytic Tableaux and Related Methods - 24th International Conference, TABLEAUX 2015, Wroc{\l}aw, Poland, September 21-24, 2015. The final publication is available at Springer via http//dx.doi.org/10.1007/978-3-319-24312-2_22