@inproceedings{2bdbf26298dc41a99111ac054a4fedfa,
title = "Towards a Combinatorial Proof Theory",
abstract = "The main part of a classical combinatorial proof is a skew fibration, which precisely captures the behavior of weakening and contraction. Relaxing the presence of these two rules leads to certain substructural 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.",
keywords = "Cographs, Combinatorial proofs, Deep inference, Fibrations, Proof theory",
author = "Benjamin Ralph and Lutz Stra{\ss}burger",
note = "Publisher Copyright: {\textcopyright} 2019, Springer Nature Switzerland AG.; 28th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods, TABLEAUX 2019 ; Conference date: 03-09-2019 Through 05-09-2019",
year = "2019",
month = jan,
day = "1",
doi = "10.1007/978-3-030-29026-9\_15",
language = "English",
isbn = "9783030290252",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer",
pages = "259--276",
editor = "Serenella Cerrito and Andrei Popescu",
booktitle = "Automated Reasoning with Analytic Tableaux and Related Methods - 28th International Conference, TABLEAUX 2019, Proceedings",
}