Skip to Main content Skip to Navigation
New interface
Reports (Research report)

Combinatorial Flows and Proof Compression

Lutz Strassburger 1 
1 PARSIFAL - Proof search and reasoning with logic specifications
LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau], Inria Saclay - Ile de France
Abstract : This paper introduces the notion of combinatorial flows as a generalization of combinatorial proofs that also includes cut and substitution as methods of proof compression. We show a normalization procedure for combinatorial flows, and how syntactic proofs in sequent calculus, deep inference, and Frege systems are translated into combinatorial flows and vice versa.
Document type :
Reports (Research report)
Complete list of metadata

Cited literature [41 references]  Display  Hide  Download
Contributor : Lutz Straßburger Connect in order to contact the contributor
Submitted on : Thursday, March 30, 2017 - 10:15:59 AM
Last modification on : Wednesday, October 26, 2022 - 8:15:08 AM


Files produced by the author(s)


  • HAL Id : hal-01498468, version 1


Lutz Strassburger. Combinatorial Flows and Proof Compression. [Research Report] RR-9048, Inria Saclay. 2017. ⟨hal-01498468⟩



Record views


Files downloads