Call Boomerang Books 1300 36 33 32

sign up for Boomerang Books BulletinGet Latest Book News + FREE Shipping. Subscribe to the Boomerang Books Bulletin eNewsletter right now!

Description - Arithmetic, Proof Theory, and Computational Complexity by Peter Clote

This book principally concerns the rapidly growing area of what might be termed "Logical Complexity Theory", the study of bounded arithmetic, propositional proof systems, length of proof, etc and relations to computational complexity theory. Issuing from a two-year NSF and Czech Academy of Sciences grant supporting a month-long workshop and 3-day conference in San Diego (1990) and Prague (1991), the book contains refereed articles concerning the existence of the most general unifier, a special case of Kreisel's conjecture on length-of-proof, propositional logic proof size, a new alternating logtime algorithm for boolean formula evaluation and relation to branching programs, interpretability between fragments of arithmetic, feasible interpretability, provability logic, open induction, Herbrand-type theorems, isomorphism between first and second order bounded arithmetics, forcing techniques in bounded arithmetic, ordinal arithmetic in L D o . Also included is an extended abstract of J P Ressayre's new approach concerning the model completeness of the theory of real closed exponential fields. Additional features of the book include (1) the transcription and translation of a recently discovered 1956 letter from K Godel to J von Neumann, asking about a polynomial time algorithm for the proof in k-symbols of predicate calculus formulas (equivalent to the P-NP question), (2) an OPEN PROBLEM LIST consisting of 7 fundamental and 39 technical questions contributed by many researchers, together with a bibliography of relevant references.

Buy Arithmetic, Proof Theory, and Computational Complexity by Peter Clote from Australia's Online Independent Bookstore, Boomerang Books.

Book Details

ISBN: 9780198536901
ISBN-10: 0198536909
Format: Hardback
(242mm x 162mm x 30mm)
Pages: 442
Imprint: Clarendon Press
Publisher: Oxford University Press
Publish Date: 6-May-1993
Country of Publication: United Kingdom

Book Reviews - Arithmetic, Proof Theory, and Computational Complexity by Peter Clote

» Have you read this book? We'd like to know what you think about it - write a review about Arithmetic, Proof Theory, and Computational Complexity book by Peter Clote and you'll earn 50c in Boomerang Bucks loyalty dollars (you must be a Boomerang Books Account Holder - it's free to sign up and there are great benefits!)

Write Review


Books By Peter Clote

Computational Molecular Biology by Peter Clote
Hardback, August 2000
$452.28 $513.95
Computer Science Logic by Peter Clote
Paperback, August 2000
Feasible Mathematics II by Peter Clote
Paperback, September 2011