<p>There is a <a href="http://eccc.hpi-web.de/report/2014/014/" rel="nofollow">paper by Beyersdorff and Chew</a> on the proof complexity of calculi for non-monotonic logic. In the references of this paper you will find links to the papers where these calculi are defined. </p>

CC BY-SA 3.0
2016-10-24T13:33:37.393Z
2016-10-24T13:33:37.393Z
Jan Johannsen
<p><strong>Is it possible to construct sequent calculus for nonmonotonic/defeasible logic?</strong> If it is possible then those logics can be encoded in proof assistants which require sequent calculus for logic to be encoded (Isabelle, Coq).</p>

<p>I am aware of the several papers from the late nineties by Ana Teresa Martins et al. about sequent calculus for paraconsistent logics. the labelling of propositions (given and derived) is used in those papers. But those papers seems to be unpublished, although they contain bright ideas, the quality of language may be a bit higher. It seems to me that those ideas are not caught by others and developed futher.</p>

<lo.logic><sequent-calculus>
Sequent calculus for nonmonotonic/defeasible logics?
TomR
# Sequent calculus for nonmonotonic/defeasible logics?

(Asked by: username_0 on 2016-10-23)

**Is it possible to construct sequent calculus for nonmonotonic/defeasible logic?** If it is possible then those logics can be encoded in proof assistants which require sequent calculus for logic to be encoded (Isabelle, Coq).

I am aware of the several papers from the late nineties by Ana Teresa Martins et al. about sequent calculus for paraconsistent logics. the labelling of propositions (given and derived) is used in those papers. But those papers seems to be unpublished, although they contain bright ideas, the quality of language may be a bit higher. It seems to me that those ideas are not caught by others and developed futher.

**Tags:** lo.logic, sequent-calculus


---

## 1 answers

### Answer by username_1 on 2016-10-24. Score: 5 | Accepted answer

There is a [paper by Beyersdorff and Chew](http://eccc.hpi-web.de/report/2014/014/) on the proof complexity of calculi for non-monotonic logic. In the references of this paper you will find links to the papers where these calculi are defined.


---

