{ "item_title" : "Definability and Computability", "item_author" : [" Yuri L. Ershov "], "item_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.", "item_img_path" : "https://covers4.booksamillion.com/covers/bam/0/30/611/039/0306110393_b.jpg", "price_data" : { "retail_price" : "239.00", "online_price" : "239.00", "our_price" : "239.00", "club_price" : "239.00", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }

Overview

Customers Also Bought

Details