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 Godel
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."
General
Is the information for this product incomplete, wrong or inappropriate?
Let us know about it.
Does this product have an incorrect or missing image?
Send us a new image.
Is this product missing categories?
Add more categories.
Review This Product
No reviews yet - be the first to create one!
Welcome to Loot.co.za!
Sign in / Register |Wishlists & Gift Vouchers |Help | Advanced search
