APAL 1999 - PDF Preprint Papers

APAL 1999

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed APAL-1999 Paper

click to vote

APAL
1999

120views more APAL 1999»

Bounded Arithmetic, Proof Complexity and Two Papers of Parikh

13 years 11 months ago

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

Samuel R. Buss

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	120	Bounded Arithmetic, Proof Complexity and Two Papers of Parikh	claim
2	97	Coalgebraic Logic	claim
3	90	On Distinguishing Quotients of Symmetric Groups	claim
4	88	A Simple Propositional S5 Tableau System	claim
5	79	Chu Spaces from the Representational Viewpoint	claim
6	74	Dynamic Linear Time Temporal Logic	claim
7	72	Lattices of Modal Logics and Their Groups of Automorphisms	claim
8	70	A Geometric Consequence of Residual Smallness	claim
9	68	Toward Categoricity for Classes with no Maximal Models	claim
10	62	Turning Cycles into Spirals	claim
11	55	Logic Programs, Well-Orderings, and Forward Chaining	claim
12	50	Choiceless Polynomial Time	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers