{"product_id":"computability-and-logic-9780521701464","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. Including a selection of exercises, adjusted for this edition, at the end of each chapter, it offers a new and simpler treatment of the representability of recursive functions, a traditional stumbling block for students on the way to the Godel incompleteness theorems.\u003cbr\u003e","brand":"Cambridge University Press","offers":[{"title":"Default Title","offer_id":50527065768210,"sku":"9780521701464","price":41.99,"currency_code":"USD","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0831\/4771\/8930\/files\/img_1c92fb2a-1f01-4f09-9eae-b334001cfc93.jpg?v=1731291446","url":"https:\/\/surprise-castle.myshopify.com\/products\/computability-and-logic-9780521701464","provider":"Surprise Castle","version":"1.0","type":"link"}