| Logical Foundations of Proof Complexity Contributor(s): Cook, Stephen (Author), Nguyen, Phuong (Author) |
|
 |
ISBN: 1107694116 ISBN-13: 9781107694118 Publisher: Cambridge University Press OUR PRICE: $72.19 Product Type: Paperback - Other Formats Published: June 2014 |
| Additional Information |
| BISAC Categories: - Mathematics | Logic |
| Dewey: 511.36 |
| Physical Information: 1.11" H x 6.14" W x 9.21" (1.66 lbs) 496 pages |
| Descriptions, Reviews, Etc. |
| Publisher Description: 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. |
Contributor Bio(s): Nguyen, Phuong: - Phuong Nguyen (Nguy n Th Ph ng) received his MSc and PhD degrees from University of Toronto in 2004 and 2008 respectively. He has been awarded postdoctoral fellowships by the Eduard ech Center for Algebra and Geometry (the Czech Republic) for 2008�, and by the Natural Sciences and Engineering Research Council of Canada (NSERC), effective September 2009.Cook, Stephen: - Stephen Cook is a professor at the University of Toronto. He is author of many research papers, including his famous 1971 paper �he Complexity of Theorem Proving Procedures� and the 1982 recipient of the Turing Award. He was awarded a Steacie Fellowship in 1977 and a Killam Research Fellowship in 1982 and received the CRM/Fields Institute Prize in 1999. He is a Fellow of the Royal Society of London and the Royal Society of Canada and was elected to membership in the National Academy of Sciences (United States) and the American Academy of Arts and Sciences. |