《Definability and Computability》是1996年出版的圖書，作者是Ershov, IUrii Leonidovich。
基本介紹
- 外文名：Definability and Computability
- 作者：Ershov, IUrii Leonidovich
- 出版時間：1996年4月
- 頁數：278 頁
- ISBN：9780306110399
- 定價：337.87 美元
內容簡介
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.
