{"product_id":"9781461276852","title":"Logic from Computer Science: Proceedings of a Workshop held November 13-17, 1989","description":"\u003cp\u003eTopics of this proceedings volume will include Computability and Complexity of Higher Type Functions by Stephen Cook, Logics for Termination and Correctness of Functional Programs by Solomon Feferman, Reals and Forcing with Elementary Topos by the well known mathematician, Saunders MacLane and Ieke Moerdijk, and Concurrent Computation as Game Playing by Anil Nerode.\u003c\/p\u003e","brand":"Springer New York","offers":[{"title":"Default Title","offer_id":47028061929712,"sku":"9781461276852","price":149.0,"currency_code":"USD","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0737\/7593\/9824\/files\/9781461276852_p0.jpg?v=1763673172","url":"https:\/\/shop-qa.barnesandnoble.com\/products\/9781461276852","provider":"Barnes \u0026 Noble (DEV)","version":"1.0","type":"link"}