scientific article; zbMATH DE number 5862941

MaRDI QIDQ3081652zbMATH OpenFDO

Authors Stanley S. Wainer

Publication date 9 March 2011

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) Complexity of proofs (03F20)

Recommendations

• The computational content of arithmetical proofs
• Lower bounds for arithmetic problems
• scientific article; zbMATH DE number 1070621
• Logic of Proofs for Bounded Arithmetic
• scientific article; zbMATH DE number 1694747
• scientific article; zbMATH DE number 1222925
• Proofs and computations
• Proving Bounds on Real-Valued Functions with Computations
• A note on bounded arithmetic
• scientific article; zbMATH DE number 1344922

Cited in

(2)

• A combinatorial bound for a restricted form of the termination theorem
• Provable (and unprovable) computability

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