# M\=im\=a\d{m}s\=a deontic logic: proof theory and applications

## TL;DR

This paper introduces a new deontic logic based on M ext=im ext=am ext=sa principles, providing proof-theoretic tools, semantics, and applications to conflicting obligations.

## Contribution

It develops a novel deontic logic with a cut-free sequent calculus, decidability results, and neighborhood semantics, applied to classical texts and conflicts.

## Key findings

- Decidability and complexity results established
- A cut-free sequent calculus developed
- Application to Vedic conflicting obligations

## 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.