Computability And Logic
George S. Boolos
Cambridge University Press (2007)
In Collection
#1961
0*
Computable functions, Logic, Symbolic and mathematical, Recursive functions
eBook-Kindle 9780521701464
English
his fourth edition of one of the classic logic textbooks has been thoroughly revised by John Burgess. The aim is to increase the pedagogical value of the book for the core market of students of philosophy and for students of mathematics and computer science as well. This book has become a classic because of its accessibility to students without a mathematical background, and because it covers not simply 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 now enhanced the book by adding a selection of problems at the end of each chapter, and by reorganising and rewriting chapters to make them more independent of each other and thus to increase the range of options available to instructors as to what to cover and what to defer. - More accessible than competitors (i.e. does not require mathematical background) • Covers staple topics for intermediate logic courses, but offers a large number of optional topics not available in competing books • Fourth edition has been reorganized to be easier to teach from. Now includes selections of problems at the end of each chapter
Product Details
LoC Classification QA9.59 .B66 2007
LoC Control Number 2007014225
Dewey 511.352
Cover Price $18.99
No. of Pages 364
Height x Width 9.8 x 6.1  inch
Personal Details
Read It No
Store Amazon
Location eLibrary-Kindle
Purchase Price $17.20
Purchase Date 10/29/2017
Links Library of Congress