Bounded arithmetic, proof complexity and two papers of Parikh Original Research Article

This article surveys R. Parikhʹs work on feasibility, bounded arithmetic and the complexity of proofs. We discuss 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.