Cover of Logical Foundations of Proof Complexity by Cook, Stephen, Nguyen, Phuong, ISBN 9780521517294
Logic

Logical Foundations of Proof Complexity

LOGICAL FOUNDATIONS OF PROOF C

Contributor(s): Author , Author Format: Hardback

Hardback ยท ISBN 9780521517294

โ‚น15,609

Inclusive of GST and other taxes

100% Quality Assurance
No Account Creation Required
Fast Delivery
Secured Transactions

Arriving at your doorstep in 10-15 days

Our logisitcs team will make sure everyitem is delivered safely

Key Specifications

ISBN 9780521517294
Subtitle LOGICAL FOUNDATIONS OF PROOF C
Publisher Cambridge University Press
Publication date April 2010
Language English
MRP ยฃ110.00 GBP
Page count 496
Item weight 207 g

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.