From syntactic proofs to combinatorial proofs

DOI10.1007/978-3-319-94205-6_32MaRDI QIDQ1799109zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Proofs without syntax
• On combinatorial proofs for modal logic
• Proof Identity for Classical Logic: Generalizing to Normality
• A new mapping between combinatorial proofs and sequent calculus proofs read out from logical flow graphs
• scientific article; zbMATH DE number 7204450

Cited in

(18)

• Proof nets for classical logic
• Recursive proof composition from accumulation schemes
• On combinatorial proofs for modal logic
• Towards a combinatorial proof theory
• On combinatorial proofs for logics of relevance and entailment
• Proofs without syntax
• Identity of Proofs Based on Normalization and Generality
• scientific article; zbMATH DE number 7204450 (Why is no real title available?)
• The problem of proof identity, and why computer scientists should care about Hilbert's 24th problem
• Proof Identity for Classical Logic: Generalizing to Normality
• Combinatorial proofs for constructive modal logic
• Combinatorial flows as bicolored atomic flows
• Combinatorial proofs and decomposition theorems for first-order logic
• Exponentially handsome proof nets and their normalization
• Logic programming with multiplicative structures
• Sequent systems on undirected graphs
• Deductive synthesis of programs with pointers: techniques, challenges, opportunities (invited paper)
• A new mapping between combinatorial proofs and sequent calculus proofs read out from logical flow graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1799109)