scientific article; zbMATH DE number 15882

zbMATH Open0738.03024MaRDI QIDQ3972528FDOQ3972528

Authors: V. P. Orevkov 

Publication date: 25 June 1992

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

Peano arithmeticcomplexity of proofsfeasible numbers

Mathematics Subject Classification ID

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

Cited In (8)

• Notations for exponentiation.
• Title not available (Why is that?)
• The shortest definition of a number in Peano arithmetic
• On feasible numbers
• Cycling in proofs and feasibility
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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)