A note on cut-elimination for classical propositional logic

DOI10.1007/s00153-021-00800-8zbMath1506.03121OpenAlexW3215149402MaRDI QIDQ2144620

Gabriele Pulcini

Publication date: 14 June 2022

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00153-021-00800-8

zbMATH Keywords

cut eliminationsequent calculusclassical propositional logic

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Classical propositional logic (03B05)

Related Items

Cut elimination by unthreading ⋮ Abduction as deductive saturation: a proof-theoretic inquiry

Cites Work

• Gentzen-type systems, resolution and tableaux
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on cut-elimination for classical propositional logic