Towards a Combinatorial Proof Theory - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2019

Towards a Combinatorial Proof Theory


The main part of a classical combinatorial proof is a skew fi-bration, which precisely captures the behavior of weakening and contraction. Relaxing the presence of these two rules leads to certain substruc-tural logics and substructural proof theory. In this paper we investigate what happens if we replace the skew fibration by other kinds of graph homomorphism. This leads us to new logics and proof systems that we call combinatorial.
Fichier principal
Vignette du fichier
CPT.pdf (402.22 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

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



Benjamin Ralph, Lutz Strassburger. Towards a Combinatorial Proof Theory. TABLEAUX 2019 - 28th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods, Sep 2019, London, United Kingdom. pp.259-276, ⟨10.1007/978-3-030-29026-9_15⟩. ⟨hal-02390417⟩
37 View
184 Download



Gmail Facebook X LinkedIn More