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:
| Hovedforfatter: | |
|---|---|
| Format: | Bog |
| Sprog: | Undetermined |
| Udgivet: |
Cambridge,New York
Cambridge University Press
2002
|
| Fag: | |
| Tags: |
Tilføj Tag
Ingen Tags, Vær først til at tagge denne postø!
|
| Thư viện lưu trữ: | Trung tâm Học liệu Trường Đại học Cần Thơ |
|---|
| Summary: | 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 |
|---|