Bounded arithmetic, proof complexity and two papers of Parikh
This article surveys R. Parikh's work on feasibility, bounded arithmetic and the complexity of proofs. The author discusses in depth two of Parikh's papers on these subjects and some of the subsequent progress in the areas of feasible arithmetic and lengths of proofs.
scientific article; zbMATH DE number 1308114
scientific article