Definability and Computability - Yuri L. Ershov
-20% with code BOOKS
Shipping in 17-23 days
30-day return policy
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, ... Full description
You May Also Like
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.
More Information
| Author | Yuri L. Ershov |
|---|---|
| Publisher | Springer US |
| Series | Siberian School of Algebra and Logic |
| Release year | 1996 |
| Cover type | Hardcover |
| EAN | 9780306110399 |