• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Logical Foundations of Proof Complexity

Logical Foundations of Proof Complexity

Paperback

Fiction

ISBN10: 1107694116
ISBN13: 9781107694118
Publisher: Cambridge University Press
Published: Mar 6 2014
Pages: 496
Weight: 1.66
Height: 1.11 Width: 6.14 Depth: 9.21
Language: 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 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.

1 different editions

Also available

Also in

Fiction