A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf
.
Bounded arithmetic, proof complexity and two papers of Parikh
1999
Annals of Pure and Applied Logic
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.
doi:10.1016/s0168-0072(98)00030-x
fatcat:7etzlilxmrau3bsjceekfwms5y