Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

37

APAL
1999

favoriteEmaildiscussreport

120views more APAL 1999»

Bounded Arithmetic, Proof Complexity and Two Papers of Parikh

13 years 10 months ago

Bounded Arithmetic, Proof Complexity and Two Papers of Parikh

Download math.ucsd.edu

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.

Samuel R. Buss

Real-time Traffic

APAL 1999 | Arithmetic | Subsequent Progress |

claim paper

Related Content

» Forcing with Random Variables and Proof Complexity

» A note on propositional proof complexity of some Ramseytype statements

» The Proof Complexity of Polynomial Identities

» Guaranteed Proofs Using Interval Arithmetic

» Nondeterministic Instance Complexity and Proof Systems with Advice

» Many Facets of Complexity in Logic

» Upper bounds on complexity of Frege proofs with limited use of certain schemata

» On the Herbrand notion of consistency for finitely axiomatizable fragments of bounded arit...

» Verified Real Number Calculations A Library for Interval Arithmetic

Post Info
More Details (n/a)

Added	22 Dec 2010
Updated	22 Dec 2010
Type	Journal
Year	1999
Where	APAL
Authors	Samuel R. Buss

Comments (0)