Optimieren Sie Ihre Suche

  • Bücher (12)

bis

Benutzerdefinierte Preisspanne (EUR)

bis

Arithmetic proof theory computational (12 Ergebnisse)

Titel: 
Mit der Detailsuche verfeinern
  • Verlag: Clarendon Pr

    0820519650 / 9780820519654

    • Hardcover

    Anbieter: ThriftBooks-Dallas, Dallas, TX, USAThriftBooks-Dallas

    Verkäufer/-in mit 5 Sternen
    Verkäufer/-in kontaktieren

    Zustand: Gebraucht - Befriedigend

    EUR 9,31

     Versand gratis 
    Versand innerhalb von USA

    Anzahl: 1 verfügbar

    Hardcover. Zustand: Good. No Jacket. Former library book; Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less.

  • Sprache: Englisch

    Verlag: Oxford: Clarendon Press, 1993

    0198536909 / 9780198536901

    • Hardcover

    Anbieter: G. & J. CHESTERS, TAMWORTH, Vereinigtes KönigreichG. & J. CHESTERS

    Verkäufer/-in mit 5 Sternen
    Verkäufer/-in kontaktieren

    Zustand: Gebraucht - Gut

    EUR 57,09

    EUR 8,41 Versand 
    Versand von Vereinigtes Königreich nach USA

    Anzahl: 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].…

  • Sprache: Englisch

    Verlag: Oxford University Press, Incorporated, 1993

    0198536909 / 9780198536901

    • Hardcover
    • Erstausgabe

    Anbieter: Better World Books: West, Reno, NV, USABetter World Books: West

    Verkäufer/-in mit 5 Sternen
    Verkäufer/-in kontaktieren

    Zustand: Gebraucht - Sehr gut

    EUR 80,58

     Versand gratis 
    Versand innerhalb von USA

    Anzahl: 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.

  • Sprache: Englisch

    Verlag: OUP Oxford, 1993

    0198536909 / 9780198536901

    • Hardcover
    • Erstausgabe

    Anbieter: Fireside Bookshop, Stroud, GLOS, Vereinigtes KönigreichFireside Bookshop

    Verkäufer/-in mit 5 Sternen
    Verkäufer/-in kontaktieren

    Verbandsmitglied: PBFA

    Zustand: Gebraucht - Gut

    EUR 92,79

    EUR 30,03 Versand 
    Versand von Vereinigtes Königreich nach USA

    Anzahl: 1 verfügbar

    Cloth. Zustand: Very Good. Zustand des Schutzumschlags: No d/j as Published. First Edition. Type: Book Small plain label inside cover.

  • Sprache: Englisch

    Verlag: Clarendon Press, 1993

    0198536909 / 9780198536901

    • Hardcover

    Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes KönigreichGreatBookPricesUK

    Verkäufer/-in mit 5 Sternen
    Verkäufer/-in kontaktieren

    Zustand: Neu

    EUR 134,08

    EUR 18,02 Versand 
    Versand von Vereinigtes Königreich nach USA

    Anzahl: Mehr als 20 verfügbar

    Zustand: New.

  • Sprache: Englisch

    Verlag: Clarendon Press, 1993

    0198536909 / 9780198536901

    • Hardcover

    Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes KönigreichGreatBookPricesUK

    Verkäufer/-in mit 5 Sternen
    Verkäufer/-in kontaktieren

    Zustand: Gebraucht - Wie neu

    EUR 150,59

    EUR 18,02 Versand 
    Versand von Vereinigtes Königreich nach USA

    Anzahl: Mehr als 20 verfügbar

    Zustand: As New. Unread book in perfect condition.

  • Sprache: Englisch

    Verlag: Clarendon Press, 1993

    0198536909 / 9780198536901

    • Hardcover

    Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes KönigreichRia Christie Collections

    Verkäufer/-in mit 5 Sternen
    Verkäufer/-in kontaktieren

    Zustand: Neu

    EUR 160,30

    EUR 15,41 Versand 
    Versand von Vereinigtes Königreich nach USA

    Anzahl: Mehr als 20 verfügbar

    Zustand: New. In English.

  • Sprache: Englisch

    Verlag: Oxford University Press, GB, 1993

    0198536909 / 9780198536901

    • Hardcover

    Anbieter: Rarewaves.com USA, London, LONDO, Vereinigtes KönigreichRarewaves.com USA

    Verkäufer/-in mit 5 Sternen
    Verkäufer/-in kontaktieren

    Zustand: Neu

    EUR 194,44

     Versand gratis 
    Versand von Vereinigtes Königreich nach USA

    Anzahl: 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.…

  • Sprache: Englisch

    Verlag: OUP Oxford, 1993

    0198536909 / 9780198536901

    • Softcover

    Anbieter: Home-set, Mannheim, DeutschlandHome-set

    Verkäufer/-in mit 5 Sternen
    Verkäufer/-in kontaktieren

    Zustand: Neu

    EUR 158,13

    EUR 49,90 Versand 
    Versand von Deutschland nach USA

    Anzahl: 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.…

  • Sprache: Englisch

    Verlag: Clarendon Press, 1993

    0198536909 / 9780198536901

    • Hardcover

    Anbieter: Kennys Bookshop and Art Galleries Ltd., Galway, GY, IrlandKennys Bookshop and Art Galleries Ltd.

    Verkäufer/-in mit 5 Sternen
    Verkäufer/-in kontaktieren

    Zustand: Neu

    EUR 231,16

    EUR 9,50 Versand 
    Versand von Irland nach USA

    Anzahl: 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. . . . .…

  • Sprache: Englisch

    Verlag: Oxford University Press, GB, 1993

    0198536909 / 9780198536901

    • Hardcover

    Anbieter: Rarewaves.com UK, London, Vereinigtes KönigreichRarewaves.com UK

    Verkäufer/-in mit 5 Sternen
    Verkäufer/-in kontaktieren

    Zustand: Neu

    EUR 187,04

    EUR 78,08 Versand 
    Versand von Vereinigtes Königreich nach USA

    Anzahl: 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.…

  • Sprache: Englisch

    Verlag: Clarendon Press, 1993

    0198536909 / 9780198536901

    • Hardcover

    Anbieter: Kennys Bookstore, Olney, MD, USAKennys Bookstore

    Verkäufer/-in mit 4 Sternen
    Verkäufer/-in kontaktieren

    Zustand: Neu

    EUR 308,94

    EUR 9,55 Versand 
    Versand innerhalb von USA

    Anzahl: 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.…