On Combinatorial Proofs for Logics of Relevance and Entailment
Résumé
Hughes' combinatorial proofs give canonical representations for classical logic proofs. In this paper we characterize classical combi-natorial proofs which also represent valid proofs for relevant logic with and without the mingle axiom. Moreover, we extend our syntax in order to represent combinatorial proofs for the more restrictive framework of entailment logic.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...