Favorites

Logical Foundations of Proof Complexity

This post was published 3 years ago. Download links are most likely obsolete.
If that's the case, try asking the author to reupload.

Logical Foundations of Proof Complexity

English | 2010 | ISBN: 052151729X | 497 Pages | PDF | 2.58 MB

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.

No comments have been posted yet. Please feel free to comment first!

    Load more replies

    Join the conversation!

    Login or Register
    to post a comment.