Classical proofs via basic logic

DOI10.1007/BFB0028016MaRDI QIDQ4218933zbMATH OpenFDO

Authors Claudia Faggian

Publication date 19 April 1999

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

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

zbMATH Keywords

basic logiccut-eliminationproof searchproofs-as-programs paradigmsequent calculusstructural rules

Mathematics Subject Classification ID

Classical propositional logic (03B05) Logic in computer science (03B70) Cut-elimination and normal-form theorems (03F05)

Recommendations

• Structural cut elimination. I: Intuitionistic and classical logic
• Free deduction: An analysis of ``computations in classical logic
• Strong normalisation of cut-elimination in classical logic
• Cut elimination for classical proofs as continuation passing style computation

Cited in

(3)

• Basic logic: reflection, symmetry, visibility
• Cut-elimination and deductive polarization in complementary classical logic
• Computer Science Logic

This page was built for publication: Classical proofs via basic logic

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