第 1/1 張圖片
Arithmetic, Proof Theory, and Computational Complexity (Oxford L
狀況：
運費：
所在地：NY, 美國
送達日期：
估計於 5月31日, 五至 6月5日, 三之間送達 運送地點 43230
退貨：
保障：
請參閱物品說明或聯絡賣家以取得詳細資料。閱覽全部詳情查看保障詳情
（不符合「eBay 買家保障方案」資格）
安心購物
賣家必須承擔此刊登物品的所有責任。
eBay 物品編號：394963968035
物品細節
- 物品狀況
- Title
- Arithmetic, Proof Theory, and Computational Complexity (Oxford L
- ISBN
- 9780198536901
- Publication Name
- Arithmetic, Proof Theory, and Computational Complexity
- Item Length
- 9.5in
- Publisher
- Oxford University Press, Incorporated
- Series
- Oxford Logic Guides
- Publication Year
- 1993
- Type
- Textbook
- Format
- Hardcover
- Language
- English
- Item Height
- 1.2in
- Item Width
- 6.4in
- Item Weight
- 28.6 Oz
- Number of Pages
- 442 Pages
關於產品
Product Information
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.
Product Identifiers
Publisher
Oxford University Press, Incorporated
ISBN-10
0198536909
ISBN-13
9780198536901
eBay Product ID (ePID)
1412592
Product Key Features
Publication Name
Arithmetic, Proof Theory, and Computational Complexity
Format
Hardcover
Language
English
Series
Oxford Logic Guides
Publication Year
1993
Type
Textbook
Number of Pages
442 Pages
Dimensions
Item Length
9.5in
Item Height
1.2in
Item Width
6.4in
Item Weight
28.6 Oz
Additional Product Features
Series Volume Number
23
Reviews
'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, '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, '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
Table of Content
Preface1. Open Problems2. Note on the Existence of Most General Semi-unifiers3. Kreisel's Conjecture for L31 (including a postscript by George Kreisel)4. Number of Symbols in Frege Proofs with and without the Deduction Rule5. Algorithm for Boolean Formula Evolution and for Tree Contraction6. Provably Total Functions in Bounded Arithmetic Theories Ri3, Ui2 and Vi27. On Polynomial Size Frege Proofs of Certain Combinatorial Principles8. Interpretability and Fragments of arithmetic9. Abbreviating Proofs Using Metamathematical Rules10. Open Induction, Tennenbaum Phenomena, and Complexity Theory11. Using Herbrand-type Theorems to Separate Strong Fragments of Arithmetic12. An Equivalence between Second Order Bounded Domain Bounded Arithmetic and First Order Bounded Arithmetic13. Integer Parts of Real Closed Exponential Fields (extended abstract)14. Making Infinite Structures Finite in Models of Second Order Bounded Arithmetic15. Ordinal Arithmetic in I16. RSUV Isomorphism17. Feasible Interpretability
Copyright Date
1993
Topic
Machine Theory, Logic, Arithmetic
Lccn
92-041659
Dewey Decimal
511.3
Intended Audience
College Audience
Dewey Edition
20
Illustrated
Yes
Genre
Computers, Mathematics
賣家提供的物品說明
商業賣家資料
增值稅識別編號：
- GB 724498118
賣家必須承擔此刊登物品的所有責任。
eBay 物品編號：394963968035
運費與處理費
物品所在地：
NY, 美國
運送地點
全球
排除：
中國, 俄羅斯聯邦, 利比亞, 南非, 墨西哥, 委內瑞拉, 巴西, 巴貝多, 愛爾蘭, 新喀里多尼亞, 法屬圭亞那, 法屬玻里尼西亞, 波多黎各, 烏克蘭, 瓜德羅普島, 留尼汪島, 英國, 阿拉斯加／夏威夷, 阿根廷, 馬提尼克島
| 運費與處理費 | 運送地點 | 運送方式 | 運送*查看送達備註 |
|---|---|---|---|
| 免運費 | 美國 | 經濟運送方式 (USPS Media MailTM) | 估計於 5月31日, 五至 6月5日, 三之間送達 運送地點 43230 |
| 處理時間 |
|---|
| 通常會在收到所有款項後的 2 個工作日內發貨。 |
| 稅項 |
|---|
| 結賬時相關稅項可能適用。 進一步了解進一步了解為 eBay 購物繳稅。 |
物品編號 394963968035 的銷售稅
物品編號 394963968035 的銷售稅
賣家會對寄往以下各州的物品收取銷售稅：
| 州／省 | 銷售稅稅率 |
|---|
退貨政策
| 收到物品後聯絡賣家的期限： | 退款方式 |
|---|---|
| 30 日 | 退款 |
買家負責支付退貨運費。
此商店的熱門類別
賣家信用評價 （513,173）
m***z (318)- 買家留下的信用評價。
過去 1 個月
購買已獲認證
Japanese language text arrived quickly in great condition. Would definitely buy from this seller again!
7***7 (4)- 買家留下的信用評價。
過去 1 個月
購買已獲認證
In the exact condition it was listed and shipped quickly.
a***d (1678)- 買家留下的信用評價。
過去 1 個月
購買已獲認證
They only sent one of two volumes. They couldn’t send the 2nd volume so they promptly REIMBURSED THE COST OF THE ORIGINAL VOLUME and allowed me to keep the volume. One of the measures of being a professional is how you try to make things right. They are clearly professionals and I highly recommend them highly