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...
Сохранить в:
| Главный автор: | Boolos, George |
|---|---|
| Формат: | |
| Язык: | Undetermined |
| Опубликовано: |
Cambridge,New York
Cambridge University Press
2002
|
| Предметы: | |
| Метки: |
Добавить метку
Нет меток, Требуется 1-ая метка записи!
|
| Thư viện lưu trữ: | Trung tâm Học liệu Trường Đại học Cần Thơ |
|---|
Схожие документы
-
Computability & unsolvability /
по: Davis, Martin, 1928-
Опубликовано: (1982) -
Logic for mathematics and computer sicence
по: Burris, Stanley N.
Опубликовано: (1998) -
Logic for computer scientists
по: Uwe Schoning
Опубликовано: (1989) -
Mathematical logic for computer science.
по: Lu Zhungwan
Опубликовано: (1989) -
Mathematical logic for computer science /
по: Lu, Zhongwan.
Опубликовано: (1989)