Order Total (1 Item Items):
Shipping Destination:
Arithmetic Proof Theory Computational (23 results)
Feedback
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (23)
- Magazines & Periodicals (No further results match this refinement)
- Comics (No further results match this refinement)
- Sheet Music (No further results match this refinement)
- Art, Prints & Posters (No further results match this refinement)
- Photographs (No further results match this refinement)
- Maps (No further results match this refinement)
- Manuscripts & Paper Collectibles (No further results match this refinement)
Condition Learn more
- New (16)
- As New, Fine or Near Fine (3)
- Very Good or Good (4)
- Fair or Poor (No further results match this refinement)
- As Described (No further results match this refinement)
Binding
- All Bindings
- Hardcover (23)
- Softcover (No further results match this refinement)
Collectible Attributes
- First Edition (1)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (4)
- Not Print on Demand (17)
Language (1)
Price
- Any Price
- Under US$ 25 (No further results match this refinement)
- US$ 25 to US$ 50 (No further results match this refinement)
- Over US$ 50
Free Shipping
Seller Location
Seller Rating
-
US$ 66.89
Convert currencyUS$ 17.51 shipping from United Kingdom to U.S.A.Quantity: 1 available
Add to basketCondition: Good. Volume 23. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. In good all round condition. No dust jacket. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,950grams, ISBN:0198536909.
-
hardcover. Condition: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority!
-
Condition: New. SUPER FAST SHIPPING.
-
US$ 130.32
Convert currencyUS$ 2.64 shipping within U.S.A.Quantity: Over 20 available
Add to basketCondition: New.
-
US$ 128.98
Convert currencyUS$ 3.99 shipping within U.S.A.Quantity: Over 20 available
Add to basketCondition: New.
-
Arithmetic, Proof Theory, and Computational Complexity (Oxford Logic Guides)
Seller: Fireside Bookshop, Stroud, GLOS, United Kingdom
Association Member: PBFA
Seller rating 5 out of 5 stars
First Edition
US$ 104.52
Convert currencyUS$ 33.83 shipping from United Kingdom to U.S.A.Quantity: 1 available
Add to basketCloth. Condition: Very Good. First Edition. Type: Book Small plain label inside cover.
-
Arithmetic, Proof Theory, and Computational Complexity (Hardcover)
Published by Oxford University Press, Oxford, 1993
ISBN 10: 0198536909 ISBN 13: 9780198536901
Language: English
Hardcover. Condition: new. Hardcover. 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 themost 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 tobranching 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 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. A consideration of Logical Complexity Theory, the study of bounded arithmetic, propositional proof systems, length of proof, etc, and relations to computational complexity theory. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
-
Condition: New. pp. 444.
-
Arithmetic, Proof Theory, and Computational Complexity
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
US$ 144.55
Convert currencyUS$ 20.30 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New.
-
Arithmetic, Proof Theory, and Computational Complexity
Published by Oxford University Press, 1993
ISBN 10: 0198536909 ISBN 13: 9780198536901
Language: English
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
Seller rating 5 out of 5 stars
US$ 180.69
Convert currencyUS$ 20.50 shipping from United Kingdom to U.S.A.Quantity: 15 available
Add to basketHardback. Condition: New. New copy - Usually dispatched within 4 working days. 840.
-
Arithmetic, Proof Theory, and Computational Complexity (Hardcover)
Published by Oxford University Press, Oxford, 1993
ISBN 10: 0198536909 ISBN 13: 9780198536901
Language: English
US$ 176.97
Convert currencyUS$ 50.06 shipping from United Kingdom to U.S.A.Quantity: 1 available
Add to basketHardcover. Condition: new. Hardcover. 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 themost 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 tobranching 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 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. A consideration of Logical Complexity Theory, the study of bounded arithmetic, propositional proof systems, length of proof, etc, and relations to computational complexity theory. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.
-
Arithmetic, Proof Theory, and Computational Complexity
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
US$ 214.60
Convert currencyUS$ 20.30 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: As New. Unread book in perfect condition.
-
US$ 203.46
Convert currencyUS$ 33.83 shipping from United Kingdom to U.S.A.Quantity: 1 available
Add to basketHardcover. Condition: Like New. Like New. book.
-
US$ 235.60
Convert currencyUS$ 2.64 shipping within U.S.A.Quantity: Over 20 available
Add to basketCondition: As New. Unread book in perfect condition.
-
Arithmetic, Proof Theory, and Computational Complexity (Oxford Logic Guides)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
US$ 233.11
Convert currencyUS$ 16.21 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
Arithmetic, Proof Theory, and Computational Complexity (Hardcover)
Published by Oxford University Press, Oxford, 1993
ISBN 10: 0198536909 ISBN 13: 9780198536901
Language: English
US$ 225.53
Convert currencyUS$ 37.00 shipping from Australia to U.S.A.Quantity: 1 available
Add to basketHardcover. Condition: new. Hardcover. 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 themost 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 tobranching 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 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. A consideration of Logical Complexity Theory, the study of bounded arithmetic, propositional proof systems, length of proof, etc, and relations to computational complexity theory. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.
-
Arithmetic, Proof Theory, and Computational Complexity
Published by Oxford University Press, 1993
ISBN 10: 0198536909 ISBN 13: 9780198536901
Language: English
US$ 598.82
Convert currencyUS$ 68.15 shipping from Spain to U.S.A.Quantity: 1 available
Add to basketCondition: Usado - bueno.
-
US$ 136.98
Convert currencyUS$ 9.32 shipping from Italy to U.S.A.Quantity: Over 20 available
Add to basketCondition: new. Questo è un articolo print on demand.
-
US$ 159.03
Convert currencyUS$ 8.79 shipping from United Kingdom to U.S.A.Quantity: 4 available
Add to basketCondition: New. Print on Demand pp. 444 9:B&W 6 x 9 in or 229 x 152 mm Case Laminate on Creme w/Gloss Lam.
-
US$ 171.86
Convert currencyUS$ 11.59 shipping from Germany to U.S.A.Quantity: 4 available
Add to basketCondition: New. PRINT ON DEMAND pp. 444.
-
Arithmetic, Proof Theory, and Computational Complexity
Published by Oxford University Press, 1993
ISBN 10: 0198536909 ISBN 13: 9780198536901
Language: English
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
Seller rating 5 out of 5 stars
US$ 182.95
Convert currencyUS$ 20.50 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketHardback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 840.
-
Arithmetic, Proof Theory, and Computational Complexity: 23 (Oxford Logic Guides)
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 5 out of 5 stars
US$ 243.77
Convert currencyUS$ 7.94 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketHRD. Condition: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
-
HRD. Condition: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
