Download or read book Arithmetic, Proof Theory, and Computational Complexity written by Peter Clote and published by Clarendon Press. This book was released on 1993-05-06 with total page 442 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book principally concerns the rapidly growing area of "Logical Complexity Theory", the study of bounded arithmetic, propositional proof systems, length of proof, etc and relations to computational complexity theory. 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.