Lecture Notes in Logic
> Perspectives in Logic

   Other ASL Books

   Member Discounts


Ordering Available Perspectives Volumes

 Editorial Board

 Instructions for Authors













Logical Foundations of Proof Complexity


Stephen Cook and Phuong Nguyen


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.

Year: 2010
Price:$83.00 ISBN-13:9780521517294
496 pages. Hardcover.
(when ordering, include the discount code ASL2016 to receive the 25% ASL member discount)


Table of Contents

1. Introduction
2. The predicate calculus and the system LK
3. Peano arithmetic and its subsystems
4. Two-sorted logic and complexity classes
5. The theory V0 and AC0
6. The theory V1 and polynomial time
7. Propositional translations
8. Theories for polynomial time and beyond
9. Theories for small classes
10. Proof systems and the reflection principle
11. Computation models





<Back to main Perspectives page



[ Meetings | Announcements | Membership | Journals | ASL Books | Links to Other Sites | ASL Info | Home]