In [6] Besnard and Schaub elaborated a novel approach to paraconsistent reasoning which lead to a family of paraconsistent consequence relations. In a sense these try to safeguard...
Abstract. We present a declarative language inspired by the pseudonatural language used in Matita for the explanation of proof terms. We show how to compile the language to proof t...
We formalise natural deduction for first-order logic in the proof assistant Coq, using De Bruijn indices for variable binding. The main judgement we model is of the form d [:] , ...
It is shown how self-resolving clauses like symmetry or transitivity, or even clauses like condensed detachment, can faithfully be deleted from the clause set thus eliminating or ...