Hughes’ combinatorial proofs give canonical representations for classical logic proofs. In this paper we characterize classical combinatorial 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.
CITATION STYLE
Acclavio, M., & Straßburger, L. (2019). On Combinatorial Proofs for Logics of Relevance and Entailment. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11541 LNCS, pp. 1–16). Springer Verlag. https://doi.org/10.1007/978-3-662-59533-6_1
Mendeley helps you to discover research relevant for your work.