114 search results - page 7 / 23 » Interactive Proof Systems with Polynomially Bounded Strategi... |
CSL
2007
Springer
14 years 2 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 ļ...
CASSIS
2004
Springer
14 years 1 months ago
2004
Springer
We present the Mobile Resource Guarantees framework: a system for ensuring that downloaded programs are free from run-time violations of resource bounds. Certiļ¬cates are attached...
CSL
2005
Springer
14 years 1 months ago
2005
Springer
The proof system Gā 0 of the quantiļ¬ed propositional calculus corresponds to NC1 , and Gā 1 corresponds to P, but no formula-based proof system that corresponds log space rea...
CP
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Refutation proofs can be viewed as a special case of constraint propagation, which is a fundamental technique in solving constraint-satisfaction problems. The generalizat...
CSL
2004
Springer
14 years 1 months ago
2004
Springer
We present a novel third-order theory W1 1 of bounded arithmetic suitable for reasoning about PSPACE functions. This theory has the advantages of avoiding the smash function symbol...