scientific article; zbMATH DE number 7178366

MaRDI QIDQ5219931zbMATH OpenFDO

Authors Alexander Leitsch

Publication date 9 March 2020

Mathematics Subject Classification ID

Proof theory in general (including proof-theoretic semantics) (03F03) Cut-elimination and normal-form theorems (03F05)

Recommendations

• Proof mining in \(L_{1}\)-approximation
• Structure of proofs and the complexity of cut elimination
• On the complexity of cutting-plane proofs
• Upper bound on the lengthening of proofs by cut elimination
• scientific article; zbMATH DE number 4087657
• scientific article; zbMATH DE number 515726
• On the complexity of cutting-plane proofs using split cuts
• scientific article; zbMATH DE number 7447752
• Revisiting Cut-Elimination: One Difficult Proof Is Really a Proof
• Cut-elimination and proof schemata

Cited in

(11)

• The problem of \(\Pi_{2}\)-cut-introduction
• Schematic cut elimination and the ordered pigeonhole principle
• scientific article; zbMATH DE number 5859846 (Why is no real title available?)
• scientific article; zbMATH DE number 7447752 (Why is no real title available?)
• Unwinding a Non-effective Cut Elimination Proof
• PROOF MINING IN L^p SPACES
• Proof Search Tree and Cut Elimination
• Logic for Programming, Artificial Intelligence, and Reasoning
• Proof Transformation by CERES
• Extraction of expansion trees
• CERES: An analysis of Fürstenberg's proof of the infinity of primes

This page was built for publication:

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