{"product_id":"computability-and-logic-paperback","title":"Computability and Logic - Paperback","description":"\u003cp\u003eby \u003cb\u003eGeorge S. Boolos\u003c\/b\u003e (Author), \u003cb\u003eJohn P. Burgess\u003c\/b\u003e (Author), \u003cb\u003eRichard C. Jeffrey\u003c\/b\u003e (Author)\u003c\/p\u003e\u003cp\u003eComputability 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.\u003c\/p\u003e\u003cdiv\u003e\n\u003cstrong\u003eNumber of Pages:\u003c\/strong\u003e 366\u003c\/div\u003e\u003cdiv\u003e\n\u003cstrong\u003eDimensions:\u003c\/strong\u003e 0.75 x 9.95 x 7.09 IN\u003c\/div\u003e\u003cdiv\u003e\n\u003cstrong\u003eIllustrated:\u003c\/strong\u003e Yes\u003c\/div\u003e\u003cdiv\u003e\n\u003cstrong\u003ePublication Date:\u003c\/strong\u003e September 17, 2007\u003c\/div\u003e","brand":"Books by splitShops","offers":[{"title":"Default Title","offer_id":47453337977010,"sku":"9780521701464","price":64.26,"currency_code":"USD","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0770\/3891\/1666\/files\/f60b81321b304ea9be2753759b087187.webp?v=1778827620","url":"https:\/\/box.dadyminds.org\/products\/computability-and-logic-paperback","provider":"DADYMINDS BOX","version":"1.0","type":"link"}