可计算性与逻辑
Computability and logic
George Boolos、Richard C. Jeffrey、George S. Boolos、John P. Burgess · 初版 1974 年
7人推荐
9位读者提及
10次提及
Hacker News 上怎么说
正在加载完整评论……
Computability and logic
George Boolos、Richard C. Jeffrey、George S. Boolos、John P. Burgess · 初版 1974 年
正在加载完整评论……
我翻过一堆逻辑学教材。到目前为止，在理论和实践两方面我都最喜欢 Boolos、Burgess 和 Jeffrey 写的《Computability and Logic》。http://www.amazon.com/Computability-Logic-George-S-Boolos/dp... 另一本在命题逻辑和谓词逻辑的基本证明细节方面讲得非常棒的书是《Beginning…
I have been through a slew of logic texts. By far, my favorite for both theory and practice is Computability and Logic by Boolos, Burgess and Jeffrey. http://www.amazon.com/Computability-Logic-George-S-Boolos/dp... Another very good book on nuts and bolts proofs in both propositional and predicate logic is Beginning…
……非常入门的介绍。之后你可能还是需要一些教材来深入学习。> 数理逻辑与哥德尔不完备定理 先看 Magnus 的《ForallX》。然后继续读 Boolos 的《Computability and Logic》（不用全读，看前言了解弄懂哥德尔不完备定理需要哪些章节）。> 集合论 Hrbacek 的《Introduction to Set Theory》—— 我目前正在开发一个在线……
…a very entry level introduction. After that you might still need some textbook for more depth. >Mathematical Logic and Godel Incompleteness Theorems Start with ForallX by Magnus. Then continue with Computability and Logic by Boolos (don't read all chapters, check out preface to see what you need for Godel Incompleteness Theorems). >Set Theory Hrbacek - Introduction to Set Theory --- I am currently developing an online…
我第一次搞懂它是通读了《Computability & Logic》（第5版）[1]。我很想再重温一遍，也很推荐给任何感兴趣且愿意花几个周末投入进去的人。 [1] https://www.goodreads.com/book/show/1556746.Computability_an...
I went through it the first time by reading over Computability & Logic (5th edition) [1]. I'd love to go over it again, and would recommend it to anyone interested who has a few weekends to invest. [1] https://www.goodreads.com/book/show/1556746.Computability_an...
完全赞同！上学时我上过一门逻辑课，用的教材就是 Boolos & Jeffrey 的《Computability and Logic》，那真是一本好书。第 2 章非常清晰地展示了康托尔用对角线法证明不可数集的存在。当时彻底震撼到我了。
Totally agree! When I was in school, I took a logic class that used Boolos & Jeffrey's "Computability and Logic", which is a really great book. Chapter 2 is a very clear presentation of Cantor's diagonalization proof that there exist uncountable sets. It blew my mind.
太酷了！感谢分享这个链接。关于图灵机、算盘机（Abacus machines）以及递归函数入门的极好论述，可以在 Boolos、Burgess 和 Jeffrey 合著的《Computability and Logic》一书中找到。
This is very cool! Thanks for posting this link. A very nice description of Turing machines, Abacus machines and in introduction to recursive functions can be found in the book "Computability and Logic" by Boolos, Burgess and Jeffrey.
哥德尔的原版证明我没看过所以不予置评，但我确实觉得《Computability and Logic》[1]相当平易近人。它是加州大学伯克利分校哲学系“中级逻辑”课程的教材（换句话说，简单到连哲学系学生都能看懂！:P）。据我所知……
I can't speak for Godel's original proof since I haven't seen it before, but I certainly found Computability and Logic [1] to be pretty approachable. It's the textbook used for UC Berkeley's "Intermediate Logic" philosophy course (in other words, it's so easy even philosophy majors can understand it! :P). From my understanding,…