scientific article; zbMATH DE number 4059392

MaRDI QIDQ3794178zbMATH OpenFDO

Authors V. P. Orevkov

Publication date 1987

zbMATH Keywords

Kreisel conjecturelengths of proofs

Mathematics Subject Classification ID

Complexity of proofs (03F20) First-order arithmetic and fragments (03F30)

Recommendations

• Lower bounds on arithmetic circuits via partial derivatives
• Partial derivatives in arithmetic complexity and beyond
• scientific article; zbMATH DE number 3931010
• Lower bound results on lengths of second-order formulas
• Termination proofs and the length of derivations
• On a method for proving exact bounds on derivational complexity in Thue systems
• scientific article; zbMATH DE number 3954903
• Bounded arithmetic, proof complexity and two papers of Parikh
• scientific article; zbMATH DE number 3952747
• scientific article; zbMATH DE number 806753

Cited in

(10)

• A theorem on generalizations of proofs
• Some results on speed-up
• scientific article; zbMATH DE number 3954903 (Why is no real title available?)
• scientific article; zbMATH DE number 4033740 (Why is no real title available?)
• scientific article; zbMATH DE number 4087658 (Why is no real title available?)
• scientific article; zbMATH DE number 15882 (Why is no real title available?)
• A Note on the Length of Proofs
• scientific article; zbMATH DE number 1984264 (Why is no real title available?)
• The shortest definition of a number in Peano arithmetic
• scientific article; zbMATH DE number 815105 (Why is no real title available?)

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