跳至内容
Arithmetic, proof theory, and computational complexity 線上預覽
關閉線上預覽
正在查...

Arithmetic, proof theory, and computational complexity

作者: Gaisi Takeuti; Peter Clote; Jan Krajíček
出版商: Oxford : Clarendon press, 1993.
叢書: Oxford logic guides, 23
版本/格式:   圖書 : 英語所有版本和格式的總覽
資料庫:WorldCat
提要:

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  再讀一些...

評定級別:

(尚未評分) 0 附有評論 - 成爲第一個。

主題
更多類似這樣的

 

在圖書館查詢

&AllPage.SpinnerRetrieving; 正在查詢有此資料的圖書館...

詳細書目

文件類型: 圖書
所有的作者/貢獻者: Gaisi Takeuti; Peter Clote; Jan Krajíček
ISBN: 0198536909 9780198536901
OCLC系統控制編碼: 463723602
注意: Bibliogr. à la fin de chaque chap.
描述: X-428 p. : [1] portr. ; 25 cm.
内容: Preface ; 1. Open Problems ; 2. Note on the Existence of Most General Semi-unifiers ; 3. Kreisel's Conjecture for L31 (including a postscript by George Kreisel) ; 4. Number of Symbols in Frege Proofs with and without the Deduction Rule ; 5. Algorithm for Boolean Formula Evolution and for Tree Contraction ; 6. Provably Total Functions in Bounded Arithmetic Theories Ri3, Ui2 and Vi2 ; 7. On Polynomial Size Frege Proofs of Certain Combinatorial Principles ; 8. Interpretability and Fragments of arithmetic ; 9. Abbreviating Proofs Using Metamathematical Rules ; 10. Open Induction, Tennenbaum Phenomena, and Complexity Theory ; 11. Using Herbrand-type Theorems to Separate Strong Fragments of Arithmetic ; 12. An Equivalence between Second Order Bounded Domain Bounded Arithmetic and First Order Bounded Arithmetic ; 13. Integer Parts of Real Closed Exponential Fields (extended abstract) ; 14. Making Infinite Structures Finite in Models of Second Order Bounded Arithmetic ; 15. Ordinal Arithmetic in I ; 16. RSUV Isomorphism ; 17. Feasible Interpretability
叢書名: Oxford logic guides, 23
責任: ed. by Peter Clote,... Jan Krajíc̆ek,...
更多資訊:

評論

社評

出版商概要

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 再讀一些...

 
讀者提供的評論
正在擷取GoodReads評論...
正在擷取DOGObooks的評論

標籤

成爲第一個
確認申請

你可能已經申請過這份資料。若還是想申請,請選確認。

連結資料


<http://www.worldcat.org/oclc/463723602>
library:oclcnum"463723602"
library:placeOfPublication
library:placeOfPublication
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:about
schema:about
schema:contributor
schema:datePublished"1993"
schema:editor
schema:editor
schema:exampleOfWork<http://worldcat.org/entity/work/id/347522273>
schema:inLanguage"en"
schema:isPartOf
schema:name"Arithmetic, proof theory, and computational complexity"
schema:publication
schema:publisher
schema:workExample
wdrs:describedby

Content-negotiable representations

關閉視窗

請登入WorldCat 

没有帳號嗎?你可很容易的 建立免費的帳號.