Definability and Computability - Yuri L. Ershov
-25% su kodu BOOKS
Pristatymas per 17-23 d.d.
30 dienų grąžinimo politika
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, ... Visas aprašymas
Jums taip pat gali patikti
Aprašymas
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.
Daugiau informacijos
| Autorius | Yuri L. Ershov |
|---|---|
| Leidėjas | Springer US |
| Series | Siberian School of Algebra and Logic |
| Išleidimo metai | 1996 |
| Viršelio tipas | Kieti viršeliai |
| EAN | 9780306110399 |