scientific article; zbMATH DE number 2051382

MaRDI QIDQ4453638zbMATH OpenFDO

Authors G. E. Mints

Publication date 7 March 2004

zbMATH Keywords

normalizationcut-eliminationcomplexity of algorithmmonotone cutpruning transformation

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Complexity of proofs (03F20) Complexity of computation (including implicit computational complexity) (03D15)

Recommendations

• Cut normal forms and proof complexity
• The cost of a cycle is a square
• Cut Elimination In Situ
• scientific article; zbMATH DE number 1086658
• On the elimination of quantifier-free cuts

Cited in

(5)

• Proofs with monotone cuts
• Cut Elimination In Situ
• Intuitionistic fixed point theories over set theories
• The cost of a cycle is a square
• Quick cut-elimination for strictly positive cuts

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 Q4453638)