Logical Foundations of Proof Complexity
Stephen Cook, Phuong Nguyen
Main subject categories: • Mathematical logic • Proof theory
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 AC⁰, AC⁰(m), TC⁰, NC¹, L, NL, NC, and P.
Catégories:
Année:
2010
Edition:
1
Editeur::
Association for Symbolic Logic [ASL]; Cambridge University Press [CUP]
Langue:
english
Pages:
497
ISBN 10:
1107694116
ISBN 13:
9781107694118
ISBN:
B01FGNZV0E
Collection:
Perspectives in Logic
Fichier:
PDF, 2.58 MB
IPFS:
,
english, 2010