Naming proofs in classical propositional logic

DOI10.1007/11417170_19MaRDI QIDQ5704013zbMATH OpenOpenAlexFDO

Authors François Lamarche, Lutz Straßburger

Publication date 11 November 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b135690

Mathematics Subject Classification ID

Classical propositional logic (03B05) Cut-elimination and normal-form theorems (03F05) Structure of proofs (03F07)

Recommendations

• Proof Nets for Classical Logic
• Expansion nets: proof-nets for propositional classical logic
• Canonical proof nets for classical logic
• Categorical proof theory of classical propositional calculus
• What is the problem with proof nets for classical logic?

Cited in

(12)

• Canonical proof nets for classical logic
• Proof nets for classical logic
• Fractional semantics for classical logic
• What is the problem with proof nets for classical logic?
• Towards Hilbert's 24th Problem: Combinatorial Proof Invariants
• Expansion nets: proof-nets for propositional classical logic
• 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
• Combinatorial flows as bicolored atomic flows
• Classical proof forestry
• Categorical proof theory of classical propositional calculus
• A new mapping between combinatorial proofs and sequent calculus proofs read out from logical flow graphs

This page was built for publication: Naming proofs in classical propositional logic

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