Sciweavers

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

11

CSR
2006
Springer

favoriteEmaildiscussreport

79views Theoretical Computer Science» more CSR 2006»

Logic of Proofs for Bounded Arithmetic

13 years 8 months ago

Logic of Proofs for Bounded Arithmetic

Download web.cs.gc.cuny.edu

The logic of proofs is known to be complete for the semantics of proofs in PA. In this paper we present a refinement of this theorem, we will show that we can assure that all the operations on proofs can be realized by feasible, that is PTIME-computable, functions. In particular we will show that the logic of proofs is complete for the semantics of proofs in Buss' bounded arithmetic S1 2.

Evan Goris

Real-time Traffic

CSR 2006 | Logic | Paper | Semantics | Theoretical Computer Science |

claim paper

Related Content

» Proofs Programs and Abstract Complexity

» Proving Bounds on RealValued Functions with Computations

» Bounded Arithmetic Proof Complexity and Two Papers of Parikh

» Many Facets of Complexity in Logic

» Unbounded ProofLength SpeedUp in Deduction Modulo

» Nepomnjascijs Theorem and Independence Proofs in Bounded Arithmetic

» Closed fragments of provability logics of constructive theories

» On the form of witness terms

» Bounded Arithmetic and Descriptive Complexity

Post Info
More Details (n/a)

Added	22 Aug 2010
Updated	22 Aug 2010
Type	Conference
Year	2006
Where	CSR
Authors	Evan Goris

Comments (0)