跳到内容
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
owl:sameAs<info:oclcnum/463723602>
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:name"Arithmetic, proof theory, and computational complexity"
schema:publisher
schema:url
schema:workExample

Content-negotiable representations

关闭窗口

请登入WorldCat 

没有张号吗?很容易就可以 建立免费的账号.