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.
Domaines
Logique en informatique [cs.LO]| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...