Computability and Logic
5th Edition
Published on 17. September 2007
Book
Hardback
366 pages
978-0-521-87752-7 (ISBN)
Description
Computability and Logic 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. This 2007 fifth edition has been thoroughly revised by John Burgess. Including a selection of exercises, adjusted for this edition, at the end of each chapter, it offers a simpler treatment of the representability of recursive functions, a traditional stumbling block for students on the way to the Godel incompleteness theorems. This updated edition is also accompanied by a website as well as an instructor's manual.
Reviews / Votes
'... gives an excellent coverage of the fundamental theoretical results about logic involving computability, undecidability, axiomatization, definability, incompleteness, etc.' American Math Monthly 'The writing style is excellent: Although many explanations are formal, they are perfectly clear. Modern, elegant proofs help the reader understand the classic theorems and keep the book to a reasonable length.' Computing Reviews ' ... a valuable asset to those who want to enhance their knowledge and strengthen their ideas in the areas of artificial intelligence, philosophy, theory of computing, discrete structures, mathematical logic. It is also useful to teachers for improving their teaching style in these subjects.' Computer EngineeringMore details
Edition
5th Revised edition
Language
English
Place of publication
Cambridge
United Kingdom
Target group
Professional and scholarly
Edition type
Revised edition
Dimensions
Height: 260 mm
Width: 183 mm
Thickness: 24 mm
Weight
883 gr
ISBN-13
978-0-521-87752-7 (9780521877527)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Other editions
Additional editions
George S. Boolos | John P. Burgess | Richard C. Jeffrey
Computability and Logic
E-Book
01/2008
5th Edition
Cambridge University Press
€30.99
Available for download
George S. Boolos
Computability and Logic
E-Book
09/2007
Cambridge University Press
€26.99
Available for download
Previous edition
George S. Boolos | John P. Burgess | Richard C. Jeffrey
Computability and Logic
Book
03/2002
4th Edition
Cambridge University Press
€68.09
Article exhausted; check for reprint
Persons
Content
Part I. Computability Theory: 1. Enumerability; 2. Diagonalization; 3. Turing computability; 4. Uncomputability; 5. Abacus computability; 6. Recursive functions; 7. Recursive sets and relations; 8. Equivalent definitions of computability; Part II. Basic Metalogic: 9. A precis of first-order logic: syntax; 10. A precis of first-order logic: semantics; 11. The undecidability of first-order logic; 12. Models; 13. The existence of models; 14. Proofs and completeness; 15. Arithmetization; 16. Representability of recursive functions; 17. Indefinability, undecidability, incompleteness; 18. The unprovability of consistency; Part III. Further Topics: 19. Normal forms; 20. The Craig interpolation theorem; 21. Monadic and dyadic logic; 22. Second-order logic; 23. Arithmetical definability; 24. Decidability of arithmetic without multiplication; 25. Non-standard models; 26. Ramsey's theorem; 27. Modal logic and provability.