Arithmetic, Proof Theory, and Computational Complexity

Language: English

Published by OUP Oxford, 1993

0198536909 / 9780198536901

  • Softcover
  • New
See all details

Seller: Home-set, Mannheim, GermanyHome-set

5-star seller

AbeBooks seller since April 13, 2026

Softcover

Condition: New

£ 135.59

£ 41.54 shipping 
Ships from Germany to U.S.A.

Quantity: 2 available

Add to basket
Free 30-day returns

Item description from seller

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. Sprache: Englisch Gewicht in Gramm: 820.…

Title
Arithmetic, Proof Theory, and Computational Complexity
Author
Krajicek, Clote
Publisher
OUP Oxford
Publication year
1993
Condition
Neu
Binding
Gebundene Ausgabe
Language
English
ISBN 10
0198536909
ISBN 13
9780198536901
Item weight
820 grams

Home-set

Mannheim, Germany

5-star seller

AbeBooks seller since April 13, 2026

Shipping rates from Germany to U.S.A.

Item10 to 12 business days8 to 10 business days
First item£ 41.54£ 62.44
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
  • Check

Specialty

Buch

Seller's business information

Home-set

Germany