Comparing the complexity of cut-elimination methods

DOI10.1007/3-540-45504-3_4MaRDI QIDQ4436026zbMATH OpenFDO

Authors Matthias Baaz, Alexander Leitsch

Publication date 23 November 2003

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2183/21830049.htm

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Complexity of proofs (03F20)

Recommendations

• Methods of cut-elimination
• Cut normal forms and proof complexity
• Cut elimination and automatic proof procedures
• Cut Elimination In Situ
• Algorithmic introduction of quantified cuts

Cited in

(5)

• Cut normal forms and proof complexity
• Book review of: Matthias Baaz and Alexander Leitsch, Methods of cut-elimination
• Sufficient conditions for cut elimination with complexity analysis
• Computer Science Logic
• Cut-elimination and redundancy-elimination by resolution

This page was built for publication: Comparing the complexity of cut-elimination methods

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