Computability and logic
Now in its fourth edition, this book has become a classic because of its accessibility to students without a mathematical background, and because it covers not only the staple topics of an intermediate logic course such as Godel's Incompleteness Theorems, but also a large number of optional top...
Đã lưu trong:
| Tác giả chính: | |
|---|---|
| Định dạng: | Sách |
| Ngôn ngữ: | Undetermined |
| Được phát hành: |
Cambridge,New York
Cambridge University Press
2002
|
| Những chủ đề: | |
| Các nhãn: |
Thêm thẻ
Không có thẻ, Là người đầu tiên thẻ bản ghi này!
|
| Thư viện lưu trữ: | Trung tâm Học liệu Trường Đại học Cần Thơ |
|---|
| LEADER | 01091nam a2200205Ia 4500 | ||
|---|---|---|---|
| 001 | CTU_159927 | ||
| 008 | 210402s9999 xx 000 0 und d | ||
| 020 | |c 8.99 | ||
| 082 | |a 511.3 | ||
| 082 | |b B724/4th | ||
| 100 | |a Boolos, George | ||
| 245 | 0 | |a Computability and logic | |
| 245 | 0 | |c George S. Boolos, John P. Burgess, Richard C. Jeffrey | |
| 260 | |a Cambridge,New York | ||
| 260 | |b Cambridge University Press | ||
| 260 | |c 2002 | ||
| 520 | |a Now in its fourth edition, this book has become a classic because of its accessibility to students without a mathematical background, and because it covers not only the staple topics of an intermediate logic course such as Godel's Incompleteness Theorems, but also a large number of optional topics from Turing's theory of computability to Ramsey's theorem. John Burgess has enhanced the book by adding a selection of problems at the end of each chapter | ||
| 650 | |a Computable functions,Recursive functions,Logic, Symbolic and mathematical,Toán Logic | ||
| 904 | |i Nguyên | ||
| 980 | |a Trung tâm Học liệu Trường Đại học Cần Thơ | ||