Computability and Logic
George Boolos, Richard C. Jeffrey
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.
Năm:
1981
In lần thứ:
2ed
Nhà xuát bản:
Cambridge University Press
Ngôn ngữ:
english
Trang:
297
ISBN 10:
0521234794
ISBN 13:
9780521234795
File:
DJVU, 2.24 MB
IPFS:
,
english, 1981