Towards a Combinatorial Proof Theory - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2019

Towards a Combinatorial Proof Theory

Résumé

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
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

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

Identifiants

Citer

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⟩
39 Consultations
186 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More