Arithmetic, Proof Theory, and Computational Complexity

Language: English

Published by OUP Oxford, 1993

0198536909 / 9780198536901

  • Hardcover
  • New
See all details

Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH

5-star seller

AbeBooks seller since August 14, 2006

Hardcover

Condition: New

US$ 206.60

US$ 39.34 shipping 
Ships from Germany to U.S.A.

Quantity: 2 available

Add to basket
Free 30-day returns

Item description from seller

nach der Bestellung gedruckt Neuware - Printed after ordering - 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 ¿ ¿ o . Also included is an extended abstract of J P Ressayre's new approach concerning the model completeness of the theory of real closed expotential 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.…

Seller Inventory # 9780198536901

Title
Arithmetic, Proof Theory, and Computational Complexity
Author
Krajicek
Publisher
OUP Oxford
Publication year
1993
Condition
Neu
Binding
Buch
Language
English
ISBN 10
0198536909
ISBN 13
9780198536901
Item weight
867 grams
Dimensions
235x157x31 mm

AHA-BUCH GmbH

Einbeck, Germany

5-star seller

AbeBooks seller since August 14, 2006

Shipping rates from Germany to U.S.A.

Item7 to 10 business days5 to 7 business days
First itemUS$ 39.34US$ 50.57
Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.

Payment methods

  • Visa
  • Mastercard
  • American Express
  • Apple Pay
  • Google Pay
  • Bank Wire Transfer
  • Check
  • Paypal

Store description

Das Unternehmen AHA-BUCH GmbH: Seit der Gründung von AHA-BUCH im Juli 2005 ist unser Hauptziel, zufriedenen Kunden so schnell und so preisgünstig wie möglich ihren Bücherwunsch zu erfüllen. Unsere Firma beschäftigt 16 Mitarbeiter, die nur ein Ziel kennen: den Kunden und seine Wünsche! Auf über 3700 m2 Fläche haben wir über 100.000 Bücher, Modernes Antiquariat und Spiele auf Lager.

Specialty

Kinderbücher & Kinderhör Casetten, German Books, Software, Natur & Tiere, Ratgeber, Sachbücher, Englische Bücher, Medizin & Gesundheit, Universität & Studium

Seller's business information

AHA-BUCH GmbH

Garlebsen 48
Einbeck, Germany 37574