- We will send in 10–14 business days.
/images/books/3011776/9780306110399.jpg)
- Author: Yuri L Ershov
- Publisher: Springer
- Year: 1996
- ISBN-10: 0306110393
- ISBN-13: 9780306110399
- Format: 17.6 x 23.1 x 2.2 cm, hardcover
- Language: English
- SAVE -10% with code: EXTRA
Reviews
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.
EXTRA 10 % discount with code: EXTRA
The promotion ends in 21d.01:46:42
The discount code is valid when purchasing from 10 €. Discounts do not stack.
- Author: Yuri L Ershov
- Publisher: Springer
- Year: 1996
- ISBN-10: 0306110393
- ISBN-13: 9780306110399
- Format: 17.6 x 23.1 x 2.2 cm, hardcover
- Language: English English
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.
Reviews