Buy New
$83.77
Qty:1
  • List Price: $114.00
  • Save: $30.23 (27%)
Only 3 left in stock (more on the way).
Ships from and sold by Amazon.com.
Gift-wrap available.
Logical Foundations of Pr... has been added to your Cart
Sell yours for a Gift Card
We'll buy it for $2.25
Learn More
Trade in now
Have one to sell? Sell on Amazon
Flip to back Flip to front
Listen Playing... Paused   You're listening to a sample of the Audible audio edition.
Learn more
See all 2 images

Logical Foundations of Proof Complexity (Perspectives in Logic) Hardcover – January 25, 2010

ISBN-13: 978-0521517294 ISBN-10: 052151729X Edition: 1st

Buy New
Price: $83.77
23 New from $64.48 12 Used from $79.75
Amazon Price New from Used from
Hardcover
"Please retry"
$83.77
$64.48 $79.75
Free Two-Day Shipping for College Students with Amazon Student Free%20Two-Day%20Shipping%20for%20College%20Students%20with%20Amazon%20Student


Hero Quick Promo
Save up to 90% on Textbooks
Rent textbooks, buy textbooks, or get up to 80% back when you sell us your books. Shop Now
$83.77 FREE Shipping. Only 3 left in stock (more on the way). Ships from and sold by Amazon.com. Gift-wrap available.

Editorial Reviews

Review

"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 material and facilitate the understanding of the concepts and results. The list of bibliographic references contains the most-representative published work in the domains of proof and computational complexity theories."
L. State, reviews.com

"This most erudite of books will stand the test of time. I will revisit it often."
George Hacken, Computing Reviews

"... very great detail and with care... The presentation of the book is most thorough and the treatment rigorous, providing the reader with the right amount of intuition and detail to follow even complicated constructions. The new book by Cook and Nguyen will become another classic for the field of bounded arithmetic and its relations to computational complexity and propositional proof complexity. It will serve as a rich source of reference for the expert and as a thorough guide to the student interested in learning about this beautiful field."
Olaf Beyersdorff, Mathematical Reviews

Book Description

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.
NO_CONTENT_IN_FEATURE

Best Books of the Month
Best Books of the Month
Want to know our Editors' picks for the best books of the month? Browse Best Books of the Month, featuring our favorite new books in more than a dozen categories.

Product Details


More About the Authors

Discover books, learn about writers, read author blogs, and more.

Customer Reviews

There are no customer reviews yet.
5 star
4 star
3 star
2 star
1 star
Share your thoughts with other customers

Set up an Amazon Giveaway

Amazon Giveaway allows you to run promotional giveaways in order to create buzz, reward your audience, and attract new followers and customers. Learn more
Logical Foundations of Proof Complexity (Perspectives in Logic)
This item: Logical Foundations of Proof Complexity (Perspectives in Logic)
Price: $114.00 $83.77
Ships from and sold by Amazon.com