{"product_id":"9780306110399","title":"Siberian School of Algebra and Logic","description":"\u003ch1\u003eSiberian School of Algebra and Logic\u003c\/h1\u003e \u003ch2\u003eErshov, Yuri L.\u003c\/h2\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 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.\u003c\/p\u003e \u003ch3\u003eDetails\u003c\/h3\u003e \u003cp\u003ePublished by: Springer\u003c\/p\u003e \u003cp\u003ePublication Date: 1996-04-30\u003c\/p\u003e \u003cp\u003eFormat: Hardcover\u003c\/p\u003e \u003cp\u003eISBN-13: 9780306110399\u003c\/p\u003e \u003cp\u003eDOI: \u003c\/p\u003e \u003cp\u003eDimensions: 234cm x156cm\u003c\/p\u003e \u003cp\u003ePages: 264\u003c\/p\u003e ","brand":"Springer US","offers":[{"title":"Default Title","offer_id":46540611879052,"sku":"9780306110399","price":215.1,"currency_code":"USD","in_stock":true}],"url":"https:\/\/lateknightbooks.com\/products\/9780306110399","provider":"Late Knight Books and Services, LLC","version":"1.0","type":"link"}