|
|
[資源]
【英美經(jīng)典教材】《Proofs and Computations》【已搜索,無重復(fù)】
【英美經(jīng)典教材】《Proofs and Computations》【已搜索,無重復(fù)】
我的這本書:
作者:Helmut Schwichtenberg, Stanley S. Wainer
2012年,480 頁,PDF,2.8 MB。
Language: English
.
封面:
。
![【英美經(jīng)典教材】《Proofs and Computations》【已搜索,無重復(fù)】]()
。
簡介:
Driven by the question, 'What is the computational content of a (formal) proof?', this book studies fundamental interactions between proof theory and computability. It provides a unique self-contained text for advanced students and researchers in mathematical logic and computer science. Part I covers basic proof theory, computability and Gödel's theorems. Part II studies and classifies provable recursion in classical systems, from fragments of Peano arithmetic up to Π11-CA0. Ordinal analysis and the (Schwichtenberg-Wainer) subrecursive hierarchies play a central role and are used in proving the 'modified finite Ramsey' and 'extended Kruskal' independence results for PA and Π11-CA0. Part III develops the theoretical underpinnings of the first author's proof assistant MINLOG. Three chapters cover higher-type computability via information systems, a constructive theory TCF of computable functionals, realizability, Dialectica interpretation, computationally significant quantifiers and connectives and polytime complexity in a two-sorted, higher-type arithmetic with linear logic.
==========================================
敬請各位朋友,下載之后,給個(gè)回帖評價(jià)。我也好繼續(xù)推出下一個(gè)最新科技書籍。
(不下載,也可以評價(jià)。)
謝謝! |
» 本帖附件資源列表
-
歡迎監(jiān)督和反饋:小木蟲僅提供交流平臺(tái),不對該內(nèi)容負(fù)責(zé)。
本內(nèi)容由用戶自主發(fā)布,如果其內(nèi)容涉及到知識(shí)產(chǎn)權(quán)問題,其責(zé)任在于用戶本人,如對版權(quán)有異議,請聯(lián)系郵箱:xiaomuchong@tal.com
- 附件 1 : Proofs_and_Computations_2012.pdf
2014-06-25 03:20:15, 3.67 M
» 收錄本帖的淘帖專輯推薦
» 猜你喜歡
|