Download or read book Logical Foundations of Proof Complexity written by Stephen Cook and published by Cambridge University Press. This book was released on 2010-01-25 with total page 496 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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. The result is a uniform treatment of many systems in the literature.