Skip to content
Open global navigation

Cambridge University Press

AcademicLocation selectorSearch toggleMain navigation toggle
Cart
Register Sign in Wishlist

Logical Foundations of Proof Complexity

$114.00

Part of Perspectives in Logic

  • Date Published: January 2010
  • availability: Available
  • format: Hardback
  • isbn: 9780521517294

$114.00
Hardback

Add to cart Add to wishlist

Other available formats:
Paperback, eBook


Looking for an examination copy?

If you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact collegesales@cambridge.org providing details of the course you are teaching.

Description
Product filter button
Description
Contents
Resources
Courses
About the Authors
  • 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.

    • Suitable as an advanced graduate text
    • Contains a wealth of original material
    • Will serve as a valuable reference for proof complexity
    Read more

    Reviews & endorsements

    "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

    See more reviews

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity

    ×

    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?

    ×

    Product details

    • Date Published: January 2010
    • format: Hardback
    • isbn: 9780521517294
    • length: 496 pages
    • dimensions: 234 x 156 x 32 mm
    • weight: 0.94kg
    • contains: 17 b/w illus. 5 tables
    • availability: Available
  • Table of Contents

    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.

  • Authors

    Stephen Cook, University of Toronto
    Stephen Cook is a professor at the University of Toronto. He is author of many research papers, including his famous 1971 paper 'The Complexity of Theorem Proving Procedures', and the 1982 recipient of the Turing Award. He was awarded a Steacie Fellowship in 1977 and a Killam Research Fellowship in 1982 and received the CRM/Fields Institute Prize in 1999. He is a Fellow of the Royal Society of London and the Royal Society of Canada and was elected to membership in the National Academy of Sciences (United States) and the American Academy of Arts and Sciences.

    Phuong Nguyen, McGill University, Montréal
    Phuong Nguyen (Nguyễn Thế Phương) received his MSc and PhD degrees from University of Toronto in 2004 and 2008 respectively. He has been awarded postdoctoral fellowships by the Eduard Čech Center for Algebra and Geometry (the Czech Republic) for 2008–9, and by the Natural Sciences and Engineering Research Council of Canada (NSERC), effective September 2009.

Sign In

Please sign in to access your account

Cancel

Not already registered? Create an account now. ×

You are now leaving the Cambridge University Press website, your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Find content that relates to you

© Cambridge University Press 2014

Back to top

Are you sure you want to delete your account?

This cannot be undone.

Cancel Delete

Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

×
Please fill in the required fields in your feedback submission.
×