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, 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 Λ Δ [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.
"synopsis" may belong to another edition of this title.
About the Author
Peter Clote is at Boston College, . Jan Krajícek is at Ceskoslovenská Akademie Ved Praha 1.
"About this title" may belong to another edition of this title.
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
Buy Used
US$ 62.95
US$ 9.27 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 1 available
Seller Image
Arithmetic, Proof Theory, and Computational Complexity (Oxford Logic Guides)
Seller: -OnTimeBooks-, Phoenix, AZ, U.S.A.
Seller rating 5 out of 5 stars
Condition: 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. Seller Inventory # OTV.0198536909.G
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
Buy Used
US$ 102.32
US$ 33.11 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
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
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, Bensenville, IL, 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. This item is printed on demand. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Seller Inventory # 9780198536901
Stock Image
Arithmetic, Proof Theory, and Computational Complexity (eng)
Print on DemandSeller: Brook Bookstore On Demand, Napoli, NA, Italy
Seller rating 5 out of 5 stars
Condition: new. Questo è un articolo print on demand. Seller Inventory # c558b3998eedd260219196ef91124831
Buy New
US$ 141.41
US$ 9.11 shipping
Ships from Italy to U.S.A.
Ships from Italy to U.S.A.
Quantity: Over 20 available
Seller Image
Arithmetic, Proof Theory, and Computational Complexity
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Seller rating 5 out of 5 stars
Condition: As New. Unread book in perfect condition. Seller Inventory # 79677
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
Buy New
US$ 148.45
US$ 19.87 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: Over 20 available
Stock Image
Arithmetic, Proof Theory, and Computational Complexity
Print on DemandSeller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 5 out of 5 stars
HRD. Condition: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Seller Inventory # L1-9780198536901
Buy New
US$ 163.14
US$ 7.77 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: Over 20 available
Seller Image
Arithmetic, Proof Theory, and Computational Complexity
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: As New. Unread book in perfect condition. Seller Inventory # 79677
Buy Used
US$ 164.25
US$ 19.87 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: Over 20 available