scientific article; zbMATH DE number 15882

MaRDI QIDQ3972528zbMATH OpenFDO

Authors V. P. Orevkov

Publication date 25 June 1992

zbMATH Keywords

Peano arithmeticcomplexity of proofsfeasible numbers

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 3974958
• scientific article; zbMATH DE number 4059392
• scientific article; zbMATH DE number 4033740
• Local consistency of arithmetic with an attainability predicate
• Polynomially and superexponentially shorter proofs in fragments of arithmetic

Cited in

(8)

• Notations for exponentiation.
• scientific article; zbMATH DE number 4033740 (Why is no real title available?)
• The shortest definition of a number in Peano arithmetic
• On feasible numbers
• Cycling in proofs and feasibility
• scientific article; zbMATH DE number 3954903 (Why is no real title available?)
• scientific article; zbMATH DE number 3974958 (Why is no real title available?)
• Local consistency of arithmetic with an attainability predicate

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