Computability and Logic
George S. Boolos
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.
Kateqoriyalar:
İl:
2002
Nəşr:
4
Nəşriyyat:
Cambridge University Press
Dil:
english
Səhifələr:
370
ISBN 10:
0782128742
ISBN 13:
9780782128741
Fayl:
PDF, 17.21 MB
IPFS:
,
english, 2002