You might also like

More about Computability and Logic

• Book details
• Synopsis
• Trending among others

You get 320 loyalty points

Book synopsis

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.

Book details

Book category Books in English Mathematics & science Mathematics Mathematical foundations

• Full title: Computability and Logic
• Author: George S. BoolosJohn P. BurgessRichard C. Jeffrey
• Language: English
• Binding: Hardback
• Number of pages: 366
• EAN: 9780521877527
• ISBN: 0521877520
• ID: 02048628
• Publisher: Cambridge University Press
• Weight: 798 g
• Dimensions: 253 × 184 × 25 mm
• Date of publishing: 17. September 2007

Trending among others

---

---

---