ISBN: 9780198536901 - arithmetic, proof theory, and computational complexity (oxford logic guides, band 23) (26 Ergebnisse)

- Hardcover
- Erstausgabe
Anbieter: Row By Row Bookshop, Sugar Grove, NC, USARow By Row Bookshop
Verkäufer/-in kontaktierenVerkäufer/-in mit 4 SternenZustand: Gebraucht - Befriedigend
EUR 56,33
EUR 4,56 VersandVersand innerhalb von USAAnzahl: 1 verfügbar
Hardcover. Zustand: 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.

- Hardcover
Anbieter: G. & J. CHESTERS, TAMWORTH, Vereinigtes KönigreichG. & J. CHESTERS
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Gebraucht - Gut
EUR 56,95
EUR 8,39 VersandVersand von Vereinigtes Königreich nach USAAnzahl: 1 verfügbar
Hardcover. Zustand: 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].…

- Hardcover
- Erstausgabe
Anbieter: Better World Books: West, Reno, NV, USABetter World Books: West
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Gebraucht - Sehr gut
EUR 80,74
Versand gratisVersand innerhalb von USAAnzahl: 1 verfügbar
Zustand: Fine. 1st Edition. Used book that is in almost brand-new condition. May contain a remainder mark. Better World Books: Buy Books. Do Good.

- Hardcover
Anbieter: -OnTimeBooks-, Phoenix, AZ, USA-OnTimeBooks-
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Gebraucht - Befriedigend
EUR 84,91
Versand gratisVersand innerhalb von USAAnzahl: 1 verfügbar
Zustand: good. A copy that has been read, remains in good condition. All pages are intact, and the cover is intact. The spine and cover show signs of wear. Pages can include notes and highlighting and show signs of wear, and the copy can include "From the library of" labels or previous owner inscriptions. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item! Ships via media mail.…

- Hardcover
- Erstausgabe
Anbieter: Fireside Bookshop, Stroud, GLOS, Vereinigtes KönigreichFireside Bookshop
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenVerbandsmitglied: PBFA
Zustand: Gebraucht - Gut
EUR 92,56
EUR 29,95 VersandVersand von Vereinigtes Königreich nach USAAnzahl: 1 verfügbar
Cloth. Zustand: Very Good. Zustand des Schutzumschlags: No d/j as Published. First Edition. Type: Book Small plain label inside cover.

- Hardcover
Anbieter: GreatBookPrices, Columbia, MD, USAGreatBookPrices
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 137,34
EUR 2,41 VersandVersand innerhalb von USAAnzahl: Mehr als 20 verfügbar
Zustand: New.

- Hardcover
Anbieter: GreatBookPrices, Columbia, MD, USAGreatBookPrices
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Gebraucht - Wie neu
EUR 143,12
EUR 2,41 VersandVersand innerhalb von USAAnzahl: Mehr als 20 verfügbar
Zustand: As New. Unread book in perfect condition.

- Hardcover
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes KönigreichGreatBookPricesUK
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 133,74
EUR 17,97 VersandVersand von Vereinigtes Königreich nach USAAnzahl: Mehr als 20 verfügbar
Zustand: New.

- Hardcover
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes KönigreichGreatBookPricesUK
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Gebraucht - Wie neu
EUR 150,22
EUR 17,97 VersandVersand von Vereinigtes Königreich nach USAAnzahl: Mehr als 20 verfügbar
Zustand: As New. Unread book in perfect condition.

- Hardcover
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes KönigreichRia Christie Collections
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 159,90
EUR 15,37 VersandVersand von Vereinigtes Königreich nach USAAnzahl: Mehr als 20 verfügbar
Zustand: New. In English.

- Hardcover
Anbieter: Rarewaves.com USA, London, LONDO, Vereinigtes KönigreichRarewaves.com USA
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 194,82
Versand gratisVersand von Vereinigtes Königreich nach USAAnzahl: Mehr als 20 verfügbar
Hardback. Zustand: 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 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.…

- Softcover
Anbieter: Home-set, Mannheim, DeutschlandHome-set
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 158,13
EUR 49,90 VersandVersand von Deutschland nach USAAnzahl: 2 verfügbar
Gebundene Ausgabe. Zustand: Neu. 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.…

- Hardcover
Anbieter: Kennys Bookshop and Art Galleries Ltd., Galway, GY, IrlandKennys Bookshop and Art Galleries Ltd.
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 231,16
EUR 9,50 VersandVersand von Irland nach USAAnzahl: Mehr als 20 verfügbar
Zustand: 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 references. 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. . . . .…

- Hardcover
Anbieter: Rarewaves.com UK, London, Vereinigtes KönigreichRarewaves.com UK
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 186,57
EUR 77,88 VersandVersand von Vereinigtes Königreich nach USAAnzahl: Mehr als 20 verfügbar
Hardback. Zustand: 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 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.…

- Hardcover
Anbieter: Kennys Bookstore, Olney, MD, USAKennys Bookstore
Verkäufer/-in kontaktierenVerkäufer/-in mit 4 SternenZustand: Neu
EUR 309,53
EUR 9,57 VersandVersand innerhalb von USAAnzahl: Mehr als 20 verfügbar
Zustand: 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 references. 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.…

- Hardcover
Anbieter: Mispah books, Redhill, SURRE, Vereinigtes KönigreichMispah books
Verkäufer/-in kontaktierenVerkäufer/-in mit 4 SternenZustand: Gebraucht - Wie neu
EUR 336,92
EUR 29,95 VersandVersand von Vereinigtes Königreich nach USAAnzahl: 1 verfügbar
Hardcover. Zustand: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

- Hardcover
- Print-on-Demand
Anbieter: Brook Bookstore On Demand, Napoli, NA, ItalienBrook Bookstore On Demand
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 123,92
EUR 8,00 VersandVersand von Italien nach USAAnzahl: Mehr als 20 verfügbar
Zustand: new. Questo è un articolo print on demand.

- Hardcover
- Print-on-Demand
Anbieter: PBShop.store UK, Fairford, GLOS, Vereinigtes KönigreichPBShop.store UK
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 147,58
EUR 7,03 VersandVersand von Vereinigtes Königreich nach USAAnzahl: Mehr als 20 verfügbar
HRD. Zustand: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.

- Hardcover
- Print-on-Demand
Anbieter: PBShop.store US, Wood Dale, IL, USAPBShop.store US
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 157,39
Versand gratisVersand innerhalb von USAAnzahl: Mehr als 20 verfügbar
HRD. Zustand: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.

- Hardcover
- Print-on-Demand
Anbieter: THE SAINT BOOKSTORE, Southport, Vereinigtes KönigreichTHE SAINT BOOKSTORE
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 172,68
EUR 22,95 VersandVersand von Vereinigtes Königreich nach USAAnzahl: Mehr als 20 verfügbar
Hardback. Zustand: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.

- Hardcover
- Print-on-Demand
Anbieter: CitiRetail, Stevenage, Vereinigtes KönigreichCitiRetail
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 155,49
EUR 44,33 VersandVersand von Vereinigtes Königreich nach USAAnzahl: 1 verfügbar
Hardcover. Zustand: 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. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.…

- Hardcover
- Print-on-Demand
Anbieter: Books Puddle, Woodside, NY, USABooks Puddle
Verkäufer/-in kontaktierenVerkäufer/-in mit 4 SternenZustand: Neu
EUR 202,79
EUR 3,64 VersandVersand innerhalb von USAAnzahl: 4 verfügbar
Zustand: New. Print on Demand pp. 444.

- Hardcover
- Print-on-Demand
Anbieter: preigu, Osnabrück, Deutschlandpreigu
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 137,65
EUR 70,00 VersandVersand von Deutschland nach USAAnzahl: 5 verfügbar
Buch. Zustand: 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.

- Hardcover
- Print-on-Demand
Anbieter: Majestic Books, Hounslow, Vereinigtes KönigreichMajestic Books
Verkäufer/-in kontaktierenVerkäufer/-in mit 4 SternenZustand: Neu
EUR 209,24
EUR 7,79 VersandVersand von Vereinigtes Königreich nach USAAnzahl: 4 verfügbar
Zustand: 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.

- Hardcover
- Print-on-Demand
Anbieter: AHA-BUCH GmbH, Einbeck, DeutschlandAHA-BUCH GmbH
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 179,31
EUR 35,00 VersandVersand von Deutschland nach USAAnzahl: 2 verfügbar
Buch. Zustand: 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, 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.…

- Hardcover
- Print-on-Demand
Anbieter: Biblios, frankfurt am main, HESSE, DeutschlandBiblios
Verkäufer/-in kontaktierenVerkäufer/-in mit 4 SternenZustand: Neu
EUR 206,76
EUR 9,95 VersandVersand von Deutschland nach USAAnzahl: 4 verfügbar
Zustand: New. PRINT ON DEMAND pp. 444.