01091nam a2200205Ia 4500 CTU_159927 210402s9999 xx 000 0 und d 8.99 511.3 B724/4th Boolos, George Computability and logic George S. Boolos, John P. Burgess, Richard C. Jeffrey Cambridge,New York Cambridge University Press 2002 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 Computable functions,Recursive functions,Logic, Symbolic and mathematical,Toán Logic Nguyên Trung tâm Học liệu Trường Đại học Cần Thơ