ShopSpell

Logical Foundations of Proof Complexity [Paperback]

$77.99       (Free Shipping)
100 available
  • Category: Books (Mathematics)
  • Author:  Cook, Stephen, Nguyen, Phuong
  • Author:  Cook, Stephen, Nguyen, Phuong
  • ISBN-10:  1107694116
  • ISBN-10:  1107694116
  • ISBN-13:  9781107694118
  • ISBN-13:  9781107694118
  • Publisher:  Cambridge University Press
  • Publisher:  Cambridge University Press
  • Pages:  496
  • Pages:  496
  • Binding:  Paperback
  • Binding:  Paperback
  • Pub Date:  01-May-2014
  • Pub Date:  01-May-2014
  • SKU:  1107694116-11-MPOD
  • SKU:  1107694116-11-MPOD
  • Item ID: 100822480
  • Seller: ShopSpell
  • Ships in: 2 business days
  • Transit time: Up to 5 business days
  • Delivery by: Jan 28 to Jan 30
  • Notes: Brand New Book. Order Now.
A treatise on bounded arithmetic and propositional proof complexity by the leader in the field.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.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.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 Busss theories for the polynomial hierarchy and many disparate systems for complexity classes such as AC0, AC0(m), TC0, NC1, L, NL, NC, and P.1. Introduction; 2. The predicate calculus and the system; 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. This authoritative volume on computational complexity of logical systems provides a sound background in logic for computer science and mathematics students. The book provides a number of exercises that offer insights into the presented materl3|
Add Review