Wheelers Books

This title is firm sale. Please select carefully as returns are not accepted.

Arithmetic, Proof Theory, and Computational Complexity
 

Arithmetic, Proof Theory, and Computational Complexity (Hardback)

Edited by Clote, Peter
Edited by Krajicek, Jan

  • RRP: $368.99
  • $368.99
  • To Order

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 A...cademy 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.
Read more

ISBN 9780198536901
Released NZ 6 May 1993
Publisher Oxford University Press (S1)
Format Hardback
Series Oxford Logic Guides (part: 23)
Availability
Indent title (internationally sourced), allow 8-12 weeks

Full details for this title

ISBN-13 9780198536901
Stock Available
Status Indent title (internationally sourced), allow 8-12 weeks
Publisher Oxford University Press (S1)
Imprint Clarendon Press
Released 6 May 1993
Publication Country United Kingdom United Kingdom
Format Hardback
Author(s) Edited by Clote, Peter
Edited by Krajicek, Jan
Series Oxford Logic Guides (part: 23)
Category Mathematical Logic
Combinatorics & Graph Theory
Number of Pages 442
Dimensions Width: 162mm
Height: 242mm
Spine: 30mm
Dewey Code 513
Weight 810g
Interest Age General Audience
Reading Age General Audience
Library of Congress Proof theory, Computational complexity
NBS Text Mathematics
ONIX Text Professional and scholarly

TOP