Arithmetic, Proof Theory, and Computational Complexity

This book principally concerns the area of "Logical Complexity Theory", the study of bounded arithmetic, propositional proof systems, length of proof, etc and relations to computational complexity theory. This includes an open problem list of 7 fundamental and 39 technical questions together with a bibliography of references.