{"product_id":"definability-and-computability-von-yuri-l-ershov","title":"Definability and Computability","description":"In this book, Yurii L. Ershov posits the view that  computability-in the broadest sense-can be regarded as  the Sigma-definability in the suitable sets. He presents a new  approach to providing the Gödel incompleteness theorem based on  systematic use of the formulas with the restricted quantifiers. The  volume also includes a novel exposition on the foundations of the  theory of admissible sets with urelements, using the Gandy theorem  throughout the theory's development. Other topics discussed are  forcing, Sigma-definability, dynamic logic, and Sigma-predicates of  finite types.\u003cdiv class=\"aw-variant-hidden-subtitle-div\" id=\"aw-variant-subtitle-9780306110399\"\u003e\u003ch3\u003e\u003c\/h3\u003e\u003c\/div\u003e","brand":"Libri","offers":[{"title":"Hardcover - 9780306110399","offer_id":50726523718,"sku":"9780306110399","price":235.39,"currency_code":"EUR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0940\/0622\/files\/9315d7ec-365a-4a38-82d6-7fc0b858bf54.jpg?v=1772254902","url":"https:\/\/shop.autorenwelt.de\/products\/definability-and-computability-von-yuri-l-ershov","provider":"Autorenwelt Shop","version":"1.0","type":"link"}