On Combinatorial Proofs for Logics of Relevance and Entailment - Archive ouverte HAL Access content directly
Conference Papers Year : 2019

On Combinatorial Proofs for Logics of Relevance and Entailment

(1, 2) , (2, 3)
1
2
3

Abstract

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.
Fichier principal
Vignette du fichier
CPrelevant.pdf (454.06 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02390426 , version 1 (03-12-2019)

Identifiers

Cite

Matteo Acclavio, Lutz Strassburger. On Combinatorial Proofs for Logics of Relevance and Entailment. WoLLIC 2019 - 26th International Workshop on Logic, Language, Information, and Computation, Jul 2019, Utrecht, Netherlands. pp.1-16, ⟨10.1007/978-3-662-59533-6_1⟩. ⟨hal-02390426⟩
38 View
143 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More