Articoli correlati a Logical Foundations of Proof Complexity
Sinossi
A treatise on bounded arithmetic and propositional proof complexity by the leader in the field.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Informazioni sugli autori
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.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Compra nuovo
Visualizza questo articolo
EUR 72,68
EUR 3,42 per la spedizione in U.S.A.
Destinazione, tempi e costi
Risultati della ricerca per Logical Foundations of Proof Complexity
Foto dell'editore
Logical Foundations of Proof Complexity (Perspectives in Logic)
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo ABLIING23Mar2317530275350
Quantità: Più di 20 disponibili
Foto dell'editore
Logical Foundations of Proof Complexity
Editore:
Cambridge University Press, 2014
ISBN 10: 1107694116
ISBN 13: 9781107694118
Nuovo
Paperback
Da: Revaluation Books, Exeter, Regno Unito
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: Brand New. 479 pages. 8.75x6.00x1.00 inches. In Stock. This item is printed on demand. Codice articolo __1107694116
Quantità: 1 disponibili
Foto dell'editore
Logical Foundations of Proof Complexity (Paperback)
Editore:
Cambridge University Press, Cambridge, 2014
ISBN 10: 1107694116
ISBN 13: 9781107694118
Nuovo
Paperback
Da: Grand Eagle Retail, Bensenville, IL, U.S.A.
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: 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. Codice articolo 9781107694118
Quantità: 1 disponibili
Foto dell'editore
Logical Foundations of Proof Complexity (Perspectives in Logic)
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. In. Codice articolo ria9781107694118_new
Quantità: Più di 20 disponibili
Foto dell'editore
Logical Foundations of Proof Complexity
Editore:
Cambridge University Press, 2014
ISBN 10: 1107694116
ISBN 13: 9781107694118
Nuovo
Paperback / softback
Da: THE SAINT BOOKSTORE, Southport, Regno Unito
Valutazione del venditore 5 su 5 stelle
Paperback / softback. Condizione: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 734. Codice articolo C9781107694118
Quantità: Più di 20 disponibili
Foto dell'editore
Logical Foundations of Proof Complexity
Editore:
Cambridge University Press CUP, 2014
ISBN 10: 1107694116
ISBN 13: 9781107694118
Nuovo
Brossura
Da: Books Puddle, New York, NY, U.S.A.
Valutazione del venditore 4 su 5 stelle
Condizione: New. pp. 496. Codice articolo 2697811797
Quantità: 4 disponibili
Foto dell'editore
Logical Foundations of Proof Complexity
Editore:
Cambridge University Press, 2014
ISBN 10: 1107694116
ISBN 13: 9781107694118
Nuovo
Paperback
Da: Revaluation Books, Exeter, Regno Unito
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: Brand New. 479 pages. 8.75x6.00x1.00 inches. In Stock. Codice articolo x-1107694116
Quantità: 2 disponibili
Foto dell'editore
Logical Foundations of Proof Complexity
Print on DemandDa: Biblios, Frankfurt am main, HESSE, Germania
Valutazione del venditore 5 su 5 stelle
Condizione: New. PRINT ON DEMAND pp. 496. Codice articolo 1897811807
Quantità: 4 disponibili
Foto dell'editore
Logical Foundations of Proof Complexity (Paperback)
Editore:
Cambridge University Press, Cambridge, 2014
ISBN 10: 1107694116
ISBN 13: 9781107694118
Nuovo
Paperback
Da: CitiRetail, Stevenage, Regno Unito
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: 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. Codice articolo 9781107694118
Quantità: 1 disponibili
Immagini fornite dal venditore
Logical Foundations of Proof Complexity
Print on DemandDa: moluna, Greven, Germania
Valutazione del venditore 4 su 5 stelle
Condizione: 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 . Codice articolo 447223428
Quantità: Più di 20 disponibili