188 search results - page 1 / 38 » Logic of Proofs for Bounded Arithmetic |
CSR
2006
Springer
13 years 8 months ago
2006
Springer
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 ...
CSL
2007
Springer
13 years 11 months ago
2007
Springer
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ï...
CADE
2008
Springer
14 years 5 months ago
2008
Springer
Interval-based methods are commonly used for computing numerical bounds on expressions and proving inequalities on real numbers. Yet they are hardly used in proof assistants, as th...
APAL
1999
13 years 4 months ago
1999
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...
CIE
2008
Springer
13 years 7 months ago
2008
Springer
There are many ways to define complexity in logic. In finite model theory, it is the complexity of describing properties, whereas in proof complexity it is the complexity of provin...