International Conference on Automated Reasoning with Analytic Tableaux and Related Methods

Automated Reasoning with Analytic Tableaux and Related Methods pp 323-338

Mīmāṃsā Deontic Logic: Proof Theory and Applications

  • Agata Ciabattoni
  • Elisa Freschi
  • Francesco A. Genco
  • Björn Lellmann
Conference paper

DOI: 10.1007/978-3-319-24312-2_22

Part of the Lecture Notes in Computer Science book series (LNCS, volume 9323)
Cite this paper as:
Ciabattoni A., Freschi E., Genco F.A., Lellmann B. (2015) Mīmāṃsā Deontic Logic: Proof Theory and Applications. In: De Nivelle H. (eds) Automated Reasoning with Analytic Tableaux and Related Methods. Lecture Notes in Computer Science, vol 9323. Springer, Cham

Abstract

Starting with the deontic principles in Mīmāṃsā 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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Agata Ciabattoni
    • 1
  • Elisa Freschi
    • 2
  • Francesco A. Genco
    • 1
  • Björn Lellmann
    • 1
  1. 1.TU WienViennaAustria
  2. 2.Institute for the Cultural and Intellectual History of AsiaAustrian Academy of SciencesViennaAustria

Personalised recommendations