Show Book List

 

George S Boolos,John P Burgess and Richard C Jeffrey

Computability and logic

Many books on mathematical logic soon plunge the reader into a mass of difficult to understand symbols. Computability and logic by Boolos, Burgess and Jeffrey starts off in an easier to follow style, and so gives the reader a gentler learning curve for the subject. The book starts off with a look at Turing machines, showing how they can be considered equivalent to any other computer. This is followed by an introduction to the theory of recursive functions. The second part of the book deals with first order logic, leading to the proof of Gödel's incompleteness theorem and related results.

The third part of the book moves on to more advanced topics such as second order logic and nonstandard models.

The authors generally don't give full proofs of theorems, but rather give a sketch which will enable the readers to complete the proof for themselves. This not only enables more material to be covered, but is done in a way that I felt enhanced the readers' understanding of the topics, and so the book is useful as a reference to the important considerations in the proofs. The book is aimed at those studying mathematical logic at undergraduate level, but I felt that it would also be useful for those wanting to undertake independent study of the subject.

Amazon.com info
Paperback 368 pages  
ISBN: 0521007585
Salesrank: 2678069
Weight:1.5 lbs
Published: 2002 Cambridge University Press
Marketplace:New from $13.99:Used from $7.98
Buy from Amazon.com
Amazon.co.uk info
Paperback 368 pages  
ISBN: 0521007585
Salesrank: 1820428
Weight:1.5 lbs
Published: 2002 Cambridge University Press
Marketplace:New from £11.95:Used from £9.71
Buy from Amazon.co.uk
Amazon.ca info
Paperback 368 pages  
ISBN: 0521007585
Salesrank: 1675439
Weight:1.5 lbs
Published: 2002 Cambridge University Press
Marketplace:New from CDN$ 88.08:Used from CDN$ 17.29
Buy from Amazon.ca





Product Description
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.