Articles liés à Logical Foundations of Proof Complexity
Synopsis
A treatise on bounded arithmetic and propositional proof complexity by the leader in the field.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
À propos des auteurs
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.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Acheter neuf
Afficher cet article
EUR 77,59
EUR 4,61 expédition depuis Royaume-Uni vers France
Destinations, frais et délais
Résultats de recherche pour Logical Foundations of Proof Complexity
Image d'archives
Logical Foundations of Proof Complexity (Perspectives in Logic)
Edité par
Cambridge University Press, 2014
ISBN 10 : 1107694116
ISBN 13 : 9781107694118
Neuf
Couverture souple
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. In. N° de réf. du vendeur ria9781107694118_new
Quantité disponible : Plus de 20 disponibles
Image d'archives
Logical Foundations of Proof Complexity
Edité par
Cambridge University Press, 2014
ISBN 10 : 1107694116
ISBN 13 : 9781107694118
Neuf
Paperback
Vendeur : Revaluation Books, Exeter, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Paperback. Etat : Brand New. 479 pages. 8.75x6.00x1.00 inches. In Stock. This item is printed on demand. N° de réf. du vendeur __1107694116
Quantité disponible : 1 disponible(s)
Image d'archives
Logical Foundations of Proof Complexity
Edité par
Cambridge University Press, 2014
ISBN 10 : 1107694116
ISBN 13 : 9781107694118
Neuf
Paperback / softback
Vendeur : THE SAINT BOOKSTORE, Southport, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Paperback / softback. Etat : New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 734. N° de réf. du vendeur C9781107694118
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Logical Foundations of Proof Complexity
Edité par
Cambridge University Press, 2013
ISBN 10 : 1107694116
ISBN 13 : 9781107694118
Neuf
Couverture souple
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Etat : 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 . N° de réf. du vendeur 447223428
Quantité disponible : Plus de 20 disponibles
Image d'archives
Logical Foundations of Proof Complexity (Perspectives in Logic)
Edité par
Cambridge University Press, 2014
ISBN 10 : 1107694116
ISBN 13 : 9781107694118
Ancien ou d'occasion
Paperback
Vendeur : Mispah books, Redhill, SURRE, Royaume-Uni
Évaluation du vendeur 4 sur 5 étoiles
Paperback. Etat : Like New. Like New. book. N° de réf. du vendeur ERICA79011076941166
Quantité disponible : 1 disponible(s)
Image d'archives
Logical Foundations of Proof Complexity (Paperback)
Edité par
Cambridge University Press, Cambridge, 2014
ISBN 10 : 1107694116
ISBN 13 : 9781107694118
Neuf
Paperback
Vendeur : CitiRetail, Stevenage, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Paperback. Etat : 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. N° de réf. du vendeur 9781107694118
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Logical Foundations of Proof Complexity
Edité par
Cambridge University Press, 2014
ISBN 10 : 1107694116
ISBN 13 : 9781107694118
Neuf
Taschenbuch
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. N° de réf. du vendeur 9781107694118
Quantité disponible : 1 disponible(s)
Image d'archives
Logical Foundations of Proof Complexity
Edité par
Cambridge University Press, 2014
ISBN 10 : 1107694116
ISBN 13 : 9781107694118
Neuf
Paperback
Vendeur : Revaluation Books, Exeter, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Paperback. Etat : Brand New. 479 pages. 8.75x6.00x1.00 inches. In Stock. N° de réf. du vendeur x-1107694116
Quantité disponible : 2 disponible(s)
Image d'archives
Logical Foundations of Proof Complexity (Perspectives in Logic)
Edité par
Cambridge University Press, 2014
ISBN 10 : 1107694116
ISBN 13 : 9781107694118
Neuf
Couverture souple
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur ABLIING23Mar2317530275350
Quantité disponible : Plus de 20 disponibles
Image d'archives
Logical Foundations of Proof Complexity (Paperback)
Edité par
Cambridge University Press, Cambridge, 2014
ISBN 10 : 1107694116
ISBN 13 : 9781107694118
Neuf
Paperback
Vendeur : AussieBookSeller, Truganina, VIC, Australie
Évaluation du vendeur 5 sur 5 étoiles
Paperback. Etat : 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. N° de réf. du vendeur 9781107694118
Quantité disponible : 1 disponible(s)