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. 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.

• Type: Journal
• Year: 1999
• Where: APAL
• Authors: Samuel R. Buss
• Keywords: APAL 1999, Arithmetic, Subsequent Progress