Logical Foundations of Proof Complexity

by Phuong Nguyen and Stephen Cook

Book Overview

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 complexity classes...

• Format: Paperback
• Language: English
• ISBN: 1107694116
• ISBN13: 9781107694118
• Release Date: June 2014
• Publisher: Cambridge University Press
• Length: 496 Pages
• Weight: 1.66 lbs.
• Dimensions: 1.1" x 6.1" x 9.2"