Items related to Arithmetic, Proof Theory, and Computational Complexity:...
Synopsis
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.
"synopsis" may belong to another edition of this title.
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 & 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)
"About this title" may belong to another edition of this title.
- PublisherClarendon Press
- Publication date1993
- ISBN 10 0198536909
- ISBN 13 9780198536901
- BindingHardcover
- LanguageEnglish
- Number of pages442
- EditorClote Peter, Krajícek Jan
Search results for Arithmetic, Proof Theory, and Computational Complexity:...
Stock Image
Arithmetic, proof theory, and computational complexity
Published by
Oxford: Clarendon Press, 1993
ISBN 10: 0198536909
ISBN 13: 9780198536901
Used
Hardcover
Seller: G. & J. CHESTERS, TAMWORTH, United Kingdom
Seller rating 5 out of 5 stars
Hardcover. Condition: 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]. Seller Inventory # 160018
Quantity: 1 available
Stock Image
Oxford Logic Guides: Arithmetic, Proof Theory, and Computational Complexity (Volume 23)
Seller: Anybook.com, Lincoln, United Kingdom
Seller rating 5 out of 5 stars
Condition: 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. Seller Inventory # 5753083
Quantity: 1 available
Stock Image
Arithmetic, Proof Theory, and Computational Complexity (Oxford Logic Guides)
Published by
OUP Oxford, 1993
ISBN 10: 0198536909
ISBN 13: 9780198536901
Used
Hardcover
First Edition
Seller: Fireside Bookshop, Stroud, GLOS, United Kingdom
Seller rating 5 out of 5 stars
Cloth. Condition: Very Good. First Edition. Type: Book Small plain label inside cover. Seller Inventory # 052878
Quantity: 1 available
Seller Image
Arithmetic, Proof Theory, and Computational Complexity
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # 79677-n
Quantity: Over 20 available
Stock Image
Arithmetic, Proof Theory, and Computational Complexity
Print on DemandSeller: Biblios, Frankfurt am main, HESSE, Germany
Seller rating 5 out of 5 stars
Condition: New. PRINT ON DEMAND pp. 444. Seller Inventory # 18482873
Quantity: 4 available
Stock Image
Arithmetic, Proof Theory, and Computational Complexity (Hardcover)
Published by
Oxford University Press, Oxford, 1993
ISBN 10: 0198536909
ISBN 13: 9780198536901
New
Hardcover
Seller: CitiRetail, Stevenage, United Kingdom
Seller rating 5 out of 5 stars
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 our UK warehouse or from our Australian or US warehouses, depending on stock availability. Seller Inventory # 9780198536901
Quantity: 1 available
Seller Image
Arithmetic, Proof Theory, and Computational Complexity
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # 79677-n
Quantity: Over 20 available
Stock Image
Arithmetic, Proof Theory, and Computational Complexity (Hardcover)
Published by
Oxford University Press, Oxford, 1993
ISBN 10: 0198536909
ISBN 13: 9780198536901
New
Hardcover
Seller: Grand Eagle Retail, Fairfield, OH, U.S.A.
Seller rating 5 out of 5 stars
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. Seller Inventory # 9780198536901
Quantity: 1 available
Stock Image
Arithmetic, Proof Theory, and Computational Complexity (Hardcover)
Published by
Oxford University Press, Oxford, 1993
ISBN 10: 0198536909
ISBN 13: 9780198536901
New
Hardcover
Seller: AussieBookSeller, Truganina, VIC, Australia
Seller rating 3 out of 5 stars
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 our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability. Seller Inventory # 9780198536901
Quantity: 1 available
Seller Image
Arithmetic, Proof Theory, and Computational Complexity
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Buch. Condition: Neu. Neuware - 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 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. Seller Inventory # 9780198536901
Quantity: 2 available