From syntactic proofs to combinatorial proofs

DOI10.1007/978-3-319-94205-6_32OpenAlexW2811365892MaRDI QIDQ1799109

Matteo Acclavio, Lutz Straßburger

Publication date: 18 October 2018

Full work available at URL: https://hal.inria.fr/hal-01942275/file/tableau-def.pdf

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Structure of proofs (03F07)

Related Items (3)

Deductive synthesis of programs with pointers: techniques, challenges, opportunities (invited paper) ⋮ Proof nets for classical logic ⋮ The problem of proof identity, and why computer scientists should care about Hilbert's 24th problem

This page was built for publication: From syntactic proofs to combinatorial proofs