Logical Foundations of Proof Complexity Hardback (Perspectives in Logic) - Hardcover

Cook; Nguyen

Hardcover

ISBN 10: 052151729X ISBN 13: 9780521517294

Verlag: Cambridge University Press, 2010

Inhaltsangabe

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.

Über diesen Titel

Über die Autorinnen und Autoren

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.

Details zur Ausgabe

• Verlag: Cambridge University Press
• Erscheinungsdatum: 2010
• Sprache: Englisch
• ISBN 10: 052151729X
• ISBN 13: 9780521517294
• Einband: Tapa dura
• Auflage: 1
• Anzahl der Seiten: 496
• Kontakt zum Hersteller: Nicht verfügbar
• Verantwortliche Person: Avery; https://www.avery.fr/; ; chemin des peupliers 27; Dardilly; Frankreich