Logical Foundations of Proof Complexity

Logical Foundations of Proof Complexity 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. The result is a uniform treatment of many systems in the literature. Autor: Stephen (University of Toronto) Cook, Phuong (McGill University Nguyen Wydawnictwo: Cambridge University Press Rok wydania: 2010 Okładka: twarda Liczba stron: 496 Wymiary: 23.4 x 15.6 x 3.2 cm Ilustracje: 5 Tables, unspecified; 17 Line drawings, unspecified Język: angielski ISBN: 9780521517294