读 A. S. Troelstra 之 Basic Proof Theory

A. S. Troelstra, H. Schwichtenberg. Basic Proof Theory. ISBN: 978-0-521-57223-1

模型论、证明论、递归论和公理集合论是数理逻辑的四大论。基本上也是学数理逻辑的人的必修科目。之前多少了解过模型论、递归论和公理集合论,唯独缺证明论,所以这次找了一本证明论的教材来读。

所谓“证明论”是研究证明的。在一个形式语言系统中从已知条件到待证结论之间的形式变换过程就是证明过程。这个过程中的证明规则及证明规则的性质则是证明论研究的重中之重。

本书的开始几章介绍了几种证明系统——包括自然式、根岑式和希尔伯特式等系统。需要注意的是这是三类证明系统而非三种。每一类证明系统根据不同学派的要求增减部分推理规则就形成了不同种类的推理系统。其实各种“直觉数学”,“构造数学”,“古典数学”的区别也就主要体现在这些证明规则的区别上。

介绍完证明系统之后本书介绍了这些证明系统的性质和正则。但由于过得太快,这一段我没怎么读懂。只能看出来书中用到了类型论和范畴论的知识。

再后续的章节中,本书介绍了模态逻辑中的证明、算术的证明论以及二阶证明论系统。不过这些专题我都是走马观花地看下来只知道有这么一些东西而已。


求点赞,求收藏,求分享

欢迎关注我的公众号,微信搜索:知则

目录: 01. A first Course in Logic An Introduction To Model Theory Proof Theory Computability And Complexity - Shawn Hedman(djvu) 02. Advanced Complexity Theory Lctn - Madhu Sudan(pdf) 03. Algorithm and Complexity Lctn - Herbert S. Wilf(pdf) 04. Algorithms and Theory of Computation Handbook - Mikhail J. Atallah(djvu) 05. An Introduction to Formal Language Theory that Integrates Experimentation and Proof - Allen Stoughton(pdf) 06. An Introduction To Recursive Function Theory -Nigel Cutland(pdf) 07. An Introduction to the Theory of Computation - Eitan Gurari(pdf) 08. CLASSICAL RECURSION THEORY The Theory of Functions and Sets of Natural Numbers - Piergiorgio Odifreddi(djvu) 09. Complexity of Algorithms Lctn - Peter Gacs(pdf) 10. Computation Complexity Lctn - Laszlo Lovasz(pdf) 11. Computational Complexity - Christos Papadimitriou(djvu) 12. Computational Complexity A Conceptual Perspective - Oded Goldreich(pdf) 13. Computational Complexity A Modern Approach - Sanjeev Arora(pdf) 14. Computers And Intractability A Guide To The Theory Of Np-Completeness - Michael Garey(djvu) 15. Elementary Recursion Theory and its Applications to Formal Systems - Saul Kripke(pdf) 16. Elemnts Of The Theory Of Computation 2d ed - Harry Lewis(djvu) 17. Essentials of Theoretical Computer Science - F. D. Lewis(pdf) 18. Goldreich O. Introduction to Complexity Theory (lectures, 1999)(T)(375s)(djvu) 19. Goldreich O. Introduction to complexity theory, lecture notes (1999)(375s)(pdf) 20. Introduction To Automata Theory Languages , and Computation - John Hopcroft(djvu) 21. Introduction to Complexity Theory Lecture Notes - Oded Goldreich(pdf) 22. Introduction To The Theory Of Computation - Michael Sipser(djvu) 23. Kolmogorov Complexity and Computational Complexity - Osamu Watanabe(djvu) 24. Lecture Notes for Introduction to Theory of Computation - Robert Daley(pdf) 25. Lecture Notes On Algorithm Analysis And Computation Complexity 4th ed - Ian Parberry(pdf) 26. Lewis H.R., Papadimitriou C.H. Elements of the Theory of Computation (2ed., PH, 1998)(ISBN 0132624788)(K)(T)(375s)(djvu) 27. Models of Computation - An Introduction to Computability Theory (Undergrad Topics in CS), Springer (2009)(pdf) 28. Oxford University Press - A First Course in Logic - An Introduction to Model, Proof Theory, Computability, and Complexity - 2006(pdf) 29. Parallel Complexity Theory - Ian Parberry(pdf) 30. Recursion Theory for Metamathematics - RAYMOND M. SMULLYAN(djvu) 31. Rothe J. Complexity theory and cryptology.. an introduction to cryptocomplexity (TTCS, Springer, 2005)(ISBN 3540221476)(487s)(pdf) 32. Springer - Computational Probability - Algorithms and Applications in the Mathematical Sciences - 2008(pdf) 33. The Complexity of Boolean Functions - Ingo Wegener(pdf) 34. The Computational Complexity of Machine Learning - Michael J. Kearns(pdf) 35. Theory of Computation Lecture Notes - Abhijat Vichare(pdf)
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值