Share
Logical Foundations of Proof Complexity (Perspectives in Logic) (in English)
Stephen Cook (Author)
·
Cambridge University Press
· Paperback
Logical Foundations of Proof Complexity (Perspectives in Logic) (in English) - Stephen Cook
$ 67.99
$ 75.99
You save: $ 8.00
Choose the list to add your product or create one New List
✓ Product added successfully to the Wishlist.
Go to My WishlistsIt will be shipped from our warehouse between
Tuesday, June 18 and
Wednesday, June 19.
You will receive it anywhere in United States between 1 and 3 business days after shipment.
Synopsis "Logical Foundations of Proof Complexity (Perspectives in Logic) (in English)"
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 range from AC0 for the weakest theory up to the polynomial hierarchy. Each bounded theorem in a theory translates into a family of (quantified) propositional tautologies with polynomial size proofs in the corresponding proof system. The theory proves the soundness of the associated 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.
- 0% (0)
- 0% (0)
- 0% (0)
- 0% (0)
- 0% (0)
All books in our catalog are Original.
The book is written in English.
The binding of this edition is Paperback.
✓ Producto agregado correctamente al carro, Ir a Pagar.
