Logical Foundations Of Proof Complexity (Perspectives In Logic)

Publisher: Free Press
SKU: DADAX052151729X
ISBN : 9780521517294
Availability: Only 5 Left In-stock.


Domestic Shipping:$3.99
   - OR -   

Logical Foundations of Proof Complexity (Perspectives in Logic)

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.

Specifications of Logical Foundations of Proof Complexity (Perspectives in Logic)

AuthorStephen Cook, Phuong Nguyen
PublisherCambridge University Press
Number Of Pages496
Publication Date2010-01-25
Height9.21 inch.
Length6.14 inch.
Width1.26 inch.
Weight1.8 pounds.

Write a review

Your Name:

Your Email:

Your Review:

Note: HTML is not translated!

Rating: Bad           Good

Enter the code in the box below: