Min side Kundeservice Bli medlem

Logical Foundations of Proof Complexity

«'The book under review is a comprehensive introduction to bounded arithmetic … While the book is primarily aimed at students and researchers with background in theoretical computer science, its prerequisites in computational complexity are rather mild and are summarized in the Appendix, thus the book should be easily accessible to logicians and mathematicians coming from a different background. Some familiarity with logic will help the reader, but in this respect the book is more or less self-contained, the relevant bits of proof theory and model theory are developed in the first chapters in detail.' Zentralblatt MATH»

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. Les mer

1832,-
Sendes innen 21 dager

Logg inn for å se din bonus

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.

Detaljer

Forlag
Cambridge University Press
Innbinding
Innbundet
Språk
Engelsk
ISBN
9780521517294
Utgivelsesår
2010
Format
23 x 16 cm

Om forfatteren

Stephen Cook is a professor at the University of Toronto. He is author of many research papers, including his famous 1971 paper 'The 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. 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–9, and by the Natural Sciences and Engineering Research Council of Canada (NSERC), effective September 2009.

Anmeldelser

«'The book under review is a comprehensive introduction to bounded arithmetic … While the book is primarily aimed at students and researchers with background in theoretical computer science, its prerequisites in computational complexity are rather mild and are summarized in the Appendix, thus the book should be easily accessible to logicians and mathematicians coming from a different background. Some familiarity with logic will help the reader, but in this respect the book is more or less self-contained, the relevant bits of proof theory and model theory are developed in the first chapters in detail.' Zentralblatt MATH»

Medlemmers vurdering

Oppdag mer

Bøker som ligner på Logical Foundations of Proof Complexity:

Se flere

Logg inn

Ikke medlem ennå? Registrer deg her

Glemt medlemsnummer/passord?

Handlekurv