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

Full description

Bibliographic Details

Main Author:	Cook, Stephen 1948- (Author)
Format:	Electronic eBook
Language:	English
Published:	Cambridge Cambridge University Press 2010
Series:	Perspectives in logic
Subjects:	Computational complexity Proof theory Logic, Symbolic and mathematical Konstruktive Mathematik Beweistheorie
Online Access:	BSB01 FHN01 Volltext
Summary:	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 complexity classes range from AC0 for the weakest theory up to the polynomial hierarchy. Each bounded theorem in a theory translates into a family of (quantified) propositional tautologies with polynomial size proofs in the corresponding proof system. The theory proves the soundness of the associated 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.
Item Description:	Title from publisher's bibliographic system (viewed on 05 Oct 2015)
Physical Description:	1 online resource (xv, 479 pages)
ISBN:	9780511676277
DOI:	10.1017/CBO9780511676277