Definability and Computability (Hardcover) (ISBN-13: 9780306110399)

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.

Author: Yuri L. Ershov
ISBN-10: 0306110393
ISBN-13: 9780306110399
Publisher: Springer
Language: English
Published: 04/30/1996
Pages: 264
Format: Hardcover
Weight: 1.19lbs
Size: 9.10h x 6.92w x 0.86d