Computability and logic
George S. Boolos, John P. Burgess, 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.
Kategorie:
Rok:
2002
Wydanie:
4th ed
Wydawnictwo:
Cambridge University Press
Język:
english
Strony:
370
ISBN 10:
0521809754
ISBN 13:
9780521809757
Plik:
PDF, 1.77 MB
IPFS:
,
english, 2002