Arithmetic proof theory computational (29 résultats)
- Couverture rigide
- Édition originale
Vendeur : Row By Row Bookshop, Sugar Grove, NC, Etats-UnisRow By Row Bookshop
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Occasion - Satisfaisant
EUR 54,03
EUR 4,37 expéditionExpédition nationale : Etats-UnisQuantité disponible : 1 disponible(s)
Hardcover. Etat : Good. No Dust Jacket. First Edition. An ex-library copy in original dark blue cloth lettered in gold. The usual ex-libris markings. The binding is sound, the text is clean/unmarked, and there is little cover wear. No dust jacket. Book.
- Couverture rigide
Vendeur : G. & J. CHESTERS, TAMWORTH, Royaume-UniG. & J. CHESTERS
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Occasion - Assez bon
EUR 55,48
EUR 8,17 expéditionExpédition depuis Royaume-Uni vers Etats-UnisQuantité disponible : 1 disponible(s)
Hardcover. Etat : Very Good. pp.xii,428, hardback (publisher's dark blue cloth, a broad gilt-lettered red band taking up most of the spine, at the bottom of which is the OUP open-book logo in gilt), a near-fine ex-library copy (no dust-jacket) of a book in the Oxford Logic Guides series [0198536909].
- Couverture rigide
Vendeur : Anybook.com, Lincoln, Royaume-UniAnybook.com
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Occasion - Satisfaisant
EUR 57,71
EUR 15,87 expéditionExpédition depuis Royaume-Uni vers Etats-UnisQuantité disponible : 1 disponible(s)
Etat : 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.
- Couverture rigide
- Édition originale
Vendeur : Fireside Bookshop, Stroud, GLOS, Royaume-UniFireside Bookshop
Contacter le vendeurVendeur avec une évaluation de 5 étoilesMembre d’une association professionnelle : PBFA
Etat: Occasion - Assez bon
EUR 90,17
EUR 29,18 expéditionExpédition depuis Royaume-Uni vers Etats-UnisQuantité disponible : 1 disponible(s)
Cloth. Etat : Very Good. Etat de la jaquette : No d/j as Published. First Edition. Type: Book Small plain label inside cover.
- Couverture rigide
Vendeur : GreatBookPrices, Columbia, MD, Etats-UnisGreatBookPrices
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 131,99
EUR 2,31 expéditionExpédition nationale : Etats-UnisQuantité disponible : Plus de 20 disponibles
Etat : New.
- Couverture rigide
Vendeur : GreatBookPrices, Columbia, MD, Etats-UnisGreatBookPrices
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Occasion - Comme neuf
EUR 137,00
EUR 2,31 expéditionExpédition nationale : Etats-UnisQuantité disponible : Plus de 20 disponibles
Etat : As New. Unread book in perfect condition.
- Couverture rigide
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-UniGreatBookPricesUK
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 130,82
EUR 17,51 expéditionExpédition depuis Royaume-Uni vers Etats-UnisQuantité disponible : Plus de 20 disponibles
Etat : New.
- Couverture souple
Vendeur : Rarewaves USA, OSWEGO, IL, Etats-UnisRarewaves USA
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 153,63
Frais de port gratuitsExpédition nationale : Etats-UnisQuantité disponible : Plus de 20 disponibles
Paperback. Etat : New.
- Couverture rigide
Vendeur : THE SAINT BOOKSTORE, Southport, Royaume-UniTHE SAINT BOOKSTORE
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 167,35
EUR 22,35 expéditionExpédition depuis Royaume-Uni vers Etats-UnisQuantité disponible : 15 disponible(s)
Hardback. Etat : New. New copy - Usually dispatched within 4 working days.
- Couverture rigide
Vendeur : Rarewaves.com USA, London, LONDO, Royaume-UniRarewaves.com USA
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 195,71
Frais de port gratuitsExpédition depuis Royaume-Uni vers Etats-UnisQuantité disponible : Plus de 20 disponibles
Hardback. Etat : New. 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 su…pporting 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.
- Couverture rigide
Vendeur : Rarewaves USA United, OSWEGO, IL, Etats-UnisRarewaves USA United
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 155,98
EUR 43,71 expéditionExpédition nationale : Etats-UnisQuantité disponible : Plus de 20 disponibles
Hardback. Etat : New. 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 su…pporting 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.
- Couverture rigide
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-UniGreatBookPricesUK
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Occasion - Comme neuf
EUR 189,94
EUR 17,51 expéditionExpédition depuis Royaume-Uni vers Etats-UnisQuantité disponible : Plus de 20 disponibles
Etat : As New. Unread book in perfect condition.
- Couverture rigide
Vendeur : Mispah books, Redhill, SURRE, Royaume-UniMispah books
Contacter le vendeurVendeur avec une évaluation de 4 étoilesEtat: Occasion - Comme neuf
EUR 180,34
EUR 29,18 expéditionExpédition depuis Royaume-Uni vers Etats-UnisQuantité disponible : 1 disponible(s)
Hardcover. Etat : Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
- Couverture rigide
Vendeur : Ria Christie Collections, Uxbridge, Royaume-UniRia Christie Collections
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 206,51
EUR 13,98 expéditionExpédition depuis Royaume-Uni vers Etats-UnisQuantité disponible : Plus de 20 disponibles
Etat : New. In.
- Couverture rigide
Vendeur : Kennys Bookshop and Art Galleries Ltd., Galway, GY, IrlandeKennys Bookshop and Art Galleries Ltd.
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 231,16
EUR 10,50 expéditionExpédition depuis Irlande vers Etats-UnisQuantité disponible : Plus de 20 disponibles
Etat : New. This book principally concerns the area of "Logical Complexity Theory", the study of bounded arithmetic, propositional proof systems, length of proof, etc and relations to computational complexity theory. This includes an open problem list of 7 fundamental and 39 technical questions together with a bibliography of re…ferences. Editor(s): Clote, Peter; Krajicek, Jan. Series: Oxford Logic Guides. Num Pages: 442 pages, line figures. BIC Classification: PBCD; PBV. Category: (P) Professional & Vocational. Dimension: 242 x 162 x 30. Weight in Grams: 810. . 1993. New. hardcover. . . . .
- Couverture rigide
Vendeur : Rarewaves.com UK, London, Royaume-UniRarewaves.com UK
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 184,97
EUR 75,87 expéditionExpédition depuis Royaume-Uni vers Etats-UnisQuantité disponible : Plus de 20 disponibles
Hardback. Etat : New. 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 su…pporting 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.
- Couverture rigide
Vendeur : Kennys Bookstore, Olney, MD, Etats-UnisKennys Bookstore
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 296,89
EUR 9,18 expéditionExpédition nationale : Etats-UnisQuantité disponible : Plus de 20 disponibles
Etat : New. This book principally concerns the area of "Logical Complexity Theory", the study of bounded arithmetic, propositional proof systems, length of proof, etc and relations to computational complexity theory. This includes an open problem list of 7 fundamental and 39 technical questions together with a bibliography of re…ferences. Editor(s): Clote, Peter; Krajicek, Jan. Series: Oxford Logic Guides. Num Pages: 442 pages, line figures. BIC Classification: PBCD; PBV. Category: (P) Professional & Vocational. Dimension: 242 x 162 x 30. Weight in Grams: 810. . 1993. New. hardcover. . . . . Books ship from the US and Ireland.
- Couverture rigide
- impression à la demande
Vendeur : Brook Bookstore On Demand, Napoli, NA, ItalieBrook Bookstore On Demand
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 120,67
EUR 8,00 expéditionExpédition depuis Italie vers Etats-UnisQuantité disponible : Plus de 20 disponibles
Etat : new. Questo è un articolo print on demand.
- Couverture rigide
- impression à la demande
Vendeur : Grand Eagle Retail, Bensenville, IL, Etats-UnisGrand Eagle Retail
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 134,38
Frais de port gratuitsExpédition nationale : Etats-UnisQuantité disponible : 1 disponible(s)
Hardcover. Etat : 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 Scien…ces 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. This item is printed on demand. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
- Couverture rigide
- impression à la demande
Vendeur : Books Puddle, New York, NY, Etats-UnisBooks Puddle
Contacter le vendeurVendeur avec une évaluation de 4 étoilesEtat: Neuf
EUR 182,60
EUR 3,49 expéditionExpédition nationale : Etats-UnisQuantité disponible : 4 disponible(s)
Etat : New. Print on Demand pp. 444.
- Couverture rigide
- impression à la demande
Vendeur : THE SAINT BOOKSTORE, Southport, Royaume-UniTHE SAINT BOOKSTORE
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 166,14
EUR 22,35 expéditionExpédition depuis Royaume-Uni vers Etats-UnisQuantité disponible : Plus de 20 disponibles
Hardback. Etat : New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.
- Couverture rigide
- impression à la demande
Vendeur : Majestic Books, Hounslow, Royaume-UniMajestic Books
Contacter le vendeurVendeur avec une évaluation de 4 étoilesEtat: Neuf
EUR 191,38
EUR 7,59 expéditionExpédition depuis Royaume-Uni vers Etats-UnisQuantité disponible : 4 disponible(s)
Etat : 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.
- Couverture rigide
- impression à la demande
Vendeur : CitiRetail, Stevenage, Royaume-UniCitiRetail
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 159,28
EUR 43,19 expéditionExpédition depuis Royaume-Uni vers Etats-UnisQuantité disponible : 1 disponible(s)
Hardcover. Etat : 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 Scien…ces 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. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.
- Couverture rigide
- impression à la demande
Vendeur : Biblios, frankfurt am main, HESSE, AllemagneBiblios
Contacter le vendeurVendeur avec une évaluation de 4 étoilesEtat: Neuf
EUR 190,32
EUR 9,95 expéditionExpédition depuis Allemagne vers Etats-UnisQuantité disponible : 4 disponible(s)
Etat : New. PRINT ON DEMAND pp. 444.
- Couverture rigide
- impression à la demande
Vendeur : preigu, Osnabrück, Allemagnepreigu
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 131,55
EUR 70,00 expéditionExpédition depuis Allemagne vers Etats-UnisQuantité disponible : 5 disponible(s)
Buch. Etat : Neu. Arithmetic, Proof Theory, and Computational Complexity | Clote (u. a.) | Buch | Gebunden | Englisch | 1993 | OUP Oxford | EAN 9780198536901 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu Print on Demand.
- Couverture rigide
- impression à la demande
Vendeur : PBShop.store UK, Fairford, GLOS, Royaume-UniPBShop.store UK
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 210,21
EUR 6,85 expéditionExpédition depuis Royaume-Uni vers Etats-UnisQuantité disponible : Plus de 20 disponibles
HRD. Etat : New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
- Couverture rigide
- impression à la demande
Vendeur : PBShop.store US, Wood Dale, IL, Etats-UnisPBShop.store US
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 215,50
Frais de port gratuitsExpédition nationale : Etats-UnisQuantité disponible : Plus de 20 disponibles
HRD. Etat : New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
- Couverture rigide
- impression à la demande
Vendeur : AHA-BUCH GmbH, Einbeck, AllemagneAHA-BUCH GmbH
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 157,22
EUR 64,34 expéditionExpédition depuis Allemagne vers Etats-UnisQuantité disponible : 2 disponible(s)
Buch. Etat : Neu. 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, and similar themes, and the relations of these topics to com…putational complexity theory. Issuing from atwo-year international collaboration, the book contains 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 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, and 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 the transcription and translation of a recently discovered 1956 letter from Kurt 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); and an open problem list consisting of seven fundamental and 39 technical questions contributed by many researchers, together with a bibliography of relevantreferences. This scholarly work will interest mathematical logicians, proof and recursion theorists, and researchers in computational complexity.
- Couverture rigide
- impression à la demande
Vendeur : AussieBookSeller, Truganina, VIC, AustralieAussieBookSeller
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 212,45
EUR 32,35 expéditionExpédition depuis Australie vers Etats-UnisQuantité disponible : 1 disponible(s)
Hardcover. Etat : 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 Scien…ces 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. This item is printed on demand. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.
