Items related to Logical Foundations of Proof Complexity (Perspectives...
Synopsis
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.
"synopsis" may belong to another edition of this title.
Book 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. The result is a uniform treatment of many systems in the literature.
About the Author
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.
"About this title" may belong to another edition of this title.
- PublisherCambridge University Press
- Publication date2010
- ISBN 10 052151729X
- ISBN 13 9780521517294
- BindingHardcover
- LanguageEnglish
- Edition number1
- Number of pages496
Search results for Logical Foundations of Proof Complexity (Perspectives...
Stock Image
Logical Foundations of Proof Complexity
Published by
Cambridge University Press, 2010
ISBN 10: 052151729X
ISBN 13: 9780521517294
Used
Hardcover
Seller: Ammareal, Morangis, France
Seller rating 5 out of 5 stars
Hardcover. Condition: Très bon. Ancien livre de bibliothèque. Edition 2010. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Very good. Former library book. Edition 2010. Ammareal gives back up to 15% of this item's net price to charity organizations. Seller Inventory # E-577-929
Quantity: 1 available
Seller Image
Logical Foundations of Proof Complexity
Published by
Cambridge University Press, 2010
ISBN 10: 052151729X
ISBN 13: 9780521517294
New
Hardcover
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # 8228618-n
Quantity: Over 20 available
Stock Image
Logical Foundations of Proof Complexity (Perspectives in Logic)
Published by
Cambridge University Press, 2010
ISBN 10: 052151729X
ISBN 13: 9780521517294
New
Hardcover
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In. Seller Inventory # ria9780521517294_new
Quantity: Over 20 available
Seller Image
Logical Foundations of Proof Complexity
Published by
Cambridge University Press, 2010
ISBN 10: 052151729X
ISBN 13: 9780521517294
New
Hardcover
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # 8228618-n
Quantity: Over 20 available
Stock Image
Logical Foundations of Proof Complexity (Perspectives in Logic)
Published by
Cambridge University Press, 2010
ISBN 10: 052151729X
ISBN 13: 9780521517294
New
Hardcover
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # ABLIING23Feb2416190005161
Quantity: Over 20 available
Stock Image
Logical Foundations of Proof Complexity
Published by
Cambridge University Press, 2010
ISBN 10: 052151729X
ISBN 13: 9780521517294
New
Hardcover
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
Seller rating 5 out of 5 stars
Hardback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 860. Seller Inventory # C9780521517294
Quantity: Over 20 available
Stock Image
Logical Foundations of Proof Complexity (Perspectives in Logic)
Published by
Cambridge University Press, 2010
ISBN 10: 052151729X
ISBN 13: 9780521517294
New
Hardcover
Seller: California Books, Miami, FL, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # I-9780521517294
Quantity: Over 20 available
Seller Image
Logical Foundations of Proof Complexity
Published by
Cambridge University Press, 2013
ISBN 10: 052151729X
ISBN 13: 9780521517294
New
Hardcover
Seller: moluna, Greven, Germany
Seller rating 5 out of 5 stars
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 . Seller Inventory # 446937941
Quantity: Over 20 available
Stock Image
Logical Foundations of Proof Complexity (Hardcover)
Published by
Cambridge University Press, Cambridge, 2010
ISBN 10: 052151729X
ISBN 13: 9780521517294
New
Hardcover
Seller: Grand Eagle Retail, Fairfield, OH, U.S.A.
Seller rating 5 out of 5 stars
Hardcover. Condition: new. Hardcover. 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. 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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Seller Inventory # 9780521517294
Quantity: 1 available
Seller Image
Logical Foundations of Proof Complexity
Published by
Cambridge University Press, 2010
ISBN 10: 052151729X
ISBN 13: 9780521517294
New
Hardcover
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Buch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - A treatise on bounded arithmetic and propositional proof complexity by the leader in the field. Seller Inventory # 9780521517294
Quantity: 1 available