{"product_id":"definability-and-computability-siberian-school-of-algebra-and-logic-0306110393","title":"Definability and Computability (Siberian School of Algebra and Logic)","description":"\u003cp\u003e\u003cstrong\u003eISBN:\u003c\/strong\u003e 0306110393\u003c\/p\u003e\u003cp\u003e\u003cstrong\u003eAuthor:\u003c\/strong\u003e Ershov, Yuri L.\u003c\/p\u003e\u003cp\u003e\u003cstrong\u003eCondition:\u003c\/strong\u003e New\u003c\/p\u003e\u003cp\u003eIn 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 Gdel 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.\u003c\/p\u003e","brand":"Mia Karts","offers":[{"title":"Default Title","offer_id":51735491346720,"sku":"NEW0306110393","price":242.06,"currency_code":"USD","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0980\/7426\/3840\/files\/51_JhVlwb6L.jpg?v=1779486161","url":"https:\/\/miakarts.com\/products\/definability-and-computability-siberian-school-of-algebra-and-logic-0306110393","provider":"Miakarts Books","version":"1.0","type":"link"}