Sciweavers

APAL
1999
120views more  APAL 1999»
14 years 4 days ago
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 s...
Samuel R. Buss