Bounded arithmetic, proof complexity and two papers of Parikh (Q1295443)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1308114
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bounded arithmetic, proof complexity and two papers of Parikh |
scientific article; zbMATH DE number 1308114 |
Statements
Bounded arithmetic, proof complexity and two papers of Parikh (English)
0 references
24 June 1999
0 references
This article surveys R. Parikh's work on feasibility, bounded arithmetic and the complexity of proofs. The author discusses 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.
0 references
survey
0 references
feasibility
0 references
bounded arithmetic
0 references
complexity of proofs
0 references
feasible arithmetic
0 references
0 references
0.92040175
0 references
0.9133326
0 references
0.9028983
0 references
