The Polynomial and Linear Hierarchies in V0
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
A Tight Karp-Lipton Collapse Result in Bounded Arithmetic
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
A tight Karp-Lipton collapse result in bounded arithmetic
ACM Transactions on Computational Logic (TOCL)
From feasible proofs to feasible computations
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Formal theories for linear algebra
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Observations on complete sets between linear time and polynomial time
Information and Computation
Conservative fragments of $${{S}^{1}_{2}}$$ and $${{R}^{1}_{2}}$$
Archive for Mathematical Logic
Admissible closures of polynomial time computable arithmetic
Archive for Mathematical Logic
CiE'11 Proceedings of the 7th conference on Models of computation in context: computability in Europe
The Complexity of Proving the Discrete Jordan Curve Theorem
ACM Transactions on Computational Logic (TOCL)
Characteristic set algorithms for equation solving in finite fields
Journal of Symbolic Computation
A note on SAT algorithms and proof complexity
Information Processing Letters
Applying tree languages in proof theory
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Proof complexity of non-classical logics
ESSLLI'10 Proceedings of the 2010 conference on ESSLLI 2010, and ESSLLI 2011 conference on Lectures on Logic and Computation
Short Propositional Refutations for Dense Random 3CNF Formulas
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Root finding with threshold circuits
Theoretical Computer Science
An approach for synchronizing UML models and narrative text in literate modeling
MODELS'12 Proceedings of the 15th international conference on Model Driven Engineering Languages and Systems
Some definitorial suggestions for parameterized proof complexity
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
Real closures of models of weak arithmetic
Archive for Mathematical Logic
The complexity of theorem proving in autoepistemic logic
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Journal of Computer and System Sciences
| Hi-index | 0.01 |
This book treats bounded arithmetic and propositional proof complexity from the point of view of computational complexity. The first seven chapters include the necessary logical background for the material and are suitable for a graduate course. Associated with each of many complexity classes are both a two-sorted predicate calculus theory, with induction restricted to concepts in the class, and a propositional proof system. The result is a uniform treatment of many systems in the literature, including Buss's theories for the polynomial hierarchy and many disparate systems for complexity classes such as AC0, AC0(m), TC0, NC1, L, NL, NC, and P.