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 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.
"synopsis" may belong to another edition of this title.
About the Authors
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.
"About this title" may belong to another edition of this title.
Search results for Logical Foundations of Proof Complexity (Perspectives...
Stock Image
Logical Foundations of Proof Complexity (Perspectives in Logic)
Published by
Cambridge University Press, 2014
ISBN 10: 1107694116
ISBN 13: 9781107694118
New
Softcover
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # ABLIING23Mar2317530275350
Quantity: Over 20 available
Stock Image
Logical Foundations of Proof Complexity (Paperback)
Published by
Cambridge University Press, Cambridge, 2014
ISBN 10: 1107694116
ISBN 13: 9781107694118
New
Paperback
Seller: Grand Eagle Retail, Mason, OH, U.S.A.
Seller rating 5 out of 5 stars
Paperback. Condition: new. Paperback. 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 # 9781107694118
Quantity: 1 available
Stock Image
Logical Foundations of Proof Complexity (Perspectives in Logic)
Published by
Cambridge University Press, 2014
ISBN 10: 1107694116
ISBN 13: 9781107694118
New
Softcover
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In. Seller Inventory # ria9781107694118_new
Quantity: Over 20 available
Stock Image
Logical Foundations of Proof Complexity
Published by
Cambridge University Press, 2014
ISBN 10: 1107694116
ISBN 13: 9781107694118
New
Paperback / softback
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
Seller rating 5 out of 5 stars
Paperback / softback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 734. Seller Inventory # C9781107694118
Quantity: Over 20 available
Stock Image
Logical Foundations of Proof Complexity (Perspectives in Logic)
Published by
Cambridge University Press, 2014
ISBN 10: 1107694116
ISBN 13: 9781107694118
Used
Paperback
Seller: Mispah books, Redhill, SURRE, United Kingdom
Seller rating 4 out of 5 stars
Paperback. Condition: Like New. Like New. book. Seller Inventory # ERICA79011076941166
Quantity: 1 available
Stock Image
Logical Foundations of Proof Complexity
Published by
Cambridge University Press, 2014
ISBN 10: 1107694116
ISBN 13: 9781107694118
New
Paperback
Seller: Revaluation Books, Exeter, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: Brand New. 479 pages. 8.75x6.00x1.00 inches. In Stock. This item is printed on demand. Seller Inventory # __1107694116
Quantity: 1 available
Stock Image
Logical Foundations of Proof Complexity.
Published by
SP CAMBRIDGE UNIVERSITY PRESS, 2014
ISBN 10: 1107694116
ISBN 13: 9781107694118
New
Softcover
Seller: UK BOOKS STORE, London, LONDO, United Kingdom
Seller rating 5 out of 5 stars
Condition: Brand New. Brand New! Fast Delivery US Edition and ship within 24-48 hours. Deliver by FedEx and Dhl, & Aramex, UPS, & USPS and we do accept APO and PO BOX Addresses. Order can be delivered worldwide within 7-10 days and we do have flat rate for up to 2LB. Extra shipping charges will be requested if the Book weight is more than 5 LB. This Item May be shipped from India, United states & United Kingdom. Depending on your location and availability. Seller Inventory # CBS 9781107694118
Quantity: 1 available
Stock Image
Logical Foundations of Proof Complexity (Paperback)
Published by
Cambridge University Press, Cambridge, 2014
ISBN 10: 1107694116
ISBN 13: 9781107694118
New
Paperback
Seller: CitiRetail, Stevenage, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: new. Paperback. 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 our UK warehouse or from our Australian or US warehouses, depending on stock availability. Seller Inventory # 9781107694118
Quantity: 1 available
Stock Image
Logical Foundations of Proof Complexity
Published by
Cambridge University Press, 2014
ISBN 10: 1107694116
ISBN 13: 9781107694118
New
Paperback
Seller: Revaluation Books, Exeter, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: Brand New. 479 pages. 8.75x6.00x1.00 inches. In Stock. Seller Inventory # x-1107694116
Quantity: 2 available
Stock Image
Logical Foundations of Proof Complexity (Paperback)
Published by
Cambridge University Press, Cambridge, 2014
ISBN 10: 1107694116
ISBN 13: 9781107694118
New
Paperback
Seller: AussieBookSeller, Truganina, VIC, Australia
Seller rating 5 out of 5 stars
Paperback. Condition: new. Paperback. 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 our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability. Seller Inventory # 9781107694118
Quantity: 1 available