Title of article
Bounded arithmetic, proof complexity and two papers of Parikh Original Research Article
Author/Authors
Samuel R. Buss، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1999
Pages
13
From page
43
To page
55
Abstract
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.
Keywords
Exponentiation , Bounded arithmetic , Feasibility , Proof length , Proof complexity , Unification
Journal title
Annals of Pure and Applied Logic
Serial Year
1999
Journal title
Annals of Pure and Applied Logic
Record number
896166
Link To Document