Arithmetic, Proof Theory, and Computational Complexity (Oxford Logic Guides)

Valutazione media 3
( su 1 valutazioni fornite da Goodreads )
 
9780198536901: Arithmetic, Proof Theory, and Computational Complexity (Oxford Logic Guides)

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 computational complexity theory. Issuing from a two-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 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, 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 relevant references. This scholarly work will interest mathematical logicians, proof and recursion theorists, and researchers in computational complexity.

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

About the Author:

Peter Clote is at Boston College, . Jan Krajicek is at Ceskoslovenska Akademie Ved Praha 1.

Review:

`This book is a valuable survey of the present state of research in this fascinating domain of foundational studies. It can certainly serve as an information and reference source as well as a source of problems to work on.' Journal of Logic and Computation, June '95

`This is a valuable survey of the present state of research in this fascinating domain of foundational studies. It can certainly serve as an information and reference source as well as a source of problems to work on.' Journal of Logic and Computation

`The book is on the level of a graduate course, and in this is superb. A highly recommendable book.' Mededelingen van Het Wiskundig Genootschaap, September 1996

Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.

I migliori risultati di ricerca su AbeBooks

1.

Clote
Editore: OUP Oxford (2016)
ISBN 10: 0198536909 ISBN 13: 9780198536901
Nuovi Paperback Quantità: 1
Print on Demand
Da
Ria Christie Collections
(Uxbridge, Regno Unito)
Valutazione libreria
[?]

Descrizione libro OUP Oxford, 2016. Paperback. Condizione libro: New. PRINT ON DEMAND Book; New; Publication Year 2016; Not Signed; Fast Shipping from the UK. No. book. Codice libro della libreria ria9780198536901_lsuk

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 155,22
Convertire valuta

Aggiungere al carrello

Spese di spedizione: EUR 4,23
Da: Regno Unito a: U.S.A.
Destinazione, tempi e costi

2.

Clote, Peter
Editore: Clarendon Press (1993)
ISBN 10: 0198536909 ISBN 13: 9780198536901
Nuovi Quantità: > 20
Print on Demand
Da
Pbshop
(Wood Dale, IL, U.S.A.)
Valutazione libreria
[?]

Descrizione libro Clarendon Press, 1993. HRD. Condizione libro: New. New Book.Shipped from US within 10 to 14 business days.THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Codice libro della libreria IP-9780198536901

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 173,77
Convertire valuta

Aggiungere al carrello

Spese di spedizione: EUR 3,38
In U.S.A.
Destinazione, tempi e costi

3.

Clote, Peter
Editore: Clarendon Press (1993)
ISBN 10: 0198536909 ISBN 13: 9780198536901
Nuovi Quantità: > 20
Print on Demand
Da
Books2Anywhere
(Fairford, GLOS, Regno Unito)
Valutazione libreria
[?]

Descrizione libro Clarendon Press, 1993. HRD. Condizione libro: New. New Book. Delivered from our US warehouse in 10 to 14 business days. THIS BOOK IS PRINTED ON DEMAND.Established seller since 2000. Codice libro della libreria IP-9780198536901

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 175,25
Convertire valuta

Aggiungere al carrello

Spese di spedizione: EUR 9,83
Da: Regno Unito a: U.S.A.
Destinazione, tempi e costi

4.

Editore: Oxford University Press, United Kingdom (1993)
ISBN 10: 0198536909 ISBN 13: 9780198536901
Nuovi Rilegato Quantità: 10
Print on Demand
Da
The Book Depository US
(London, Regno Unito)
Valutazione libreria
[?]

Descrizione libro Oxford University Press, United Kingdom, 1993. Hardback. Condizione libro: New. New.. Language: English . Brand New Book ***** Print on Demand *****. 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 *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. Codice libro della libreria APC9780198536901

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 213,38
Convertire valuta

Aggiungere al carrello

Spese di spedizione: GRATIS
Da: Regno Unito a: U.S.A.
Destinazione, tempi e costi

5.

Editore: Oxford University Press, United Kingdom (1993)
ISBN 10: 0198536909 ISBN 13: 9780198536901
Nuovi Rilegato Quantità: 10
Print on Demand
Da
The Book Depository
(London, Regno Unito)
Valutazione libreria
[?]

Descrizione libro Oxford University Press, United Kingdom, 1993. Hardback. Condizione libro: New. New.. Language: English . Brand New Book ***** Print on Demand *****.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 *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. Codice libro della libreria APC9780198536901

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 213,78
Convertire valuta

Aggiungere al carrello

Spese di spedizione: GRATIS
Da: Regno Unito a: U.S.A.
Destinazione, tempi e costi

6.

Editore: OUP Oxford
ISBN 10: 0198536909 ISBN 13: 9780198536901
Nuovi Rilegato Quantità: 20
Da
BuySomeBooks
(Las Vegas, NV, U.S.A.)
Valutazione libreria
[?]

Descrizione libro OUP Oxford. Hardcover. Condizione libro: New. Hardcover. 448 pages. Dimensions: 9.0in. x 6.0in. x 1.1in.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 computational complexity theory. Issuing from a two-year international collaboration, the book contains articles concerning the existence of the most general unifier, a special case of Kreisels 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, and ordinal arithmetic in L D o. Also included is an extended abstract of J. P. Ressayres 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 relevant references. This scholarly work will interest mathematical logicians, proof and recursion theorists, and researchers in computational complexity. This item ships from multiple locations. Your book may arrive from Roseburg,OR, La Vergne,TN. Hardcover. Codice libro della libreria 9780198536901

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 221,46
Convertire valuta

Aggiungere al carrello

Spese di spedizione: EUR 3,34
In U.S.A.
Destinazione, tempi e costi

7.

ISBN 10: 0198536909 ISBN 13: 9780198536901
Nuovi Quantità: > 20
Print on Demand
Da
BWB
(Valley Stream, NY, U.S.A.)
Valutazione libreria
[?]

Descrizione libro Condizione libro: New. This item is Print on Demand - Depending on your location, this item may ship from the US or UK. Codice libro della libreria POD_9780198536901

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 240,80
Convertire valuta

Aggiungere al carrello

Spese di spedizione: GRATIS
In U.S.A.
Destinazione, tempi e costi

8.

Peter Clote (Editor), Jan Krajícek (Editor)
Editore: Oxford University Press, USA (1993)
ISBN 10: 0198536909 ISBN 13: 9780198536901
Nuovi Rilegato Quantità: 1
Da
Ergodebooks
(RICHMOND, TX, U.S.A.)
Valutazione libreria
[?]

Descrizione libro Oxford University Press, USA, 1993. Hardcover. Condizione libro: New. Codice libro della libreria DADAX0198536909

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 243,62
Convertire valuta

Aggiungere al carrello

Spese di spedizione: EUR 3,38
In U.S.A.
Destinazione, tempi e costi

9.

Editore: Clarendon Press (1993)
ISBN 10: 0198536909 ISBN 13: 9780198536901
Nuovi Rilegato Prima edizione Quantità: 1
Da
Irish Booksellers
(Rumford, ME, U.S.A.)
Valutazione libreria
[?]

Descrizione libro Clarendon Press, 1993. Hardcover. Condizione libro: New. book. Codice libro della libreria M0198536909

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 278,18
Convertire valuta

Aggiungere al carrello

Spese di spedizione: GRATIS
In U.S.A.
Destinazione, tempi e costi