{"product_id":"9781107086500","title":"Computability and Logic","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.","brand":"Cambridge University Press","offers":[{"title":"Default Title","offer_id":47120383410416,"sku":"9781107086500","price":21.49,"currency_code":"USD","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0737\/7593\/9824\/files\/9781107086500_p0.jpg?v=1763690556","url":"https:\/\/shop-qa.barnesandnoble.com\/products\/9781107086500","provider":"Barnes \u0026 Noble (DEV)","version":"1.0","type":"link"}