Share
Definability and Computability (Siberian School of Algebra and Logic)
Iurii Leonidovich Ershov; Yuri L. Ershov (Author)
·
Springer
· Hardcover
Definability and Computability (Siberian School of Algebra and Logic) - Iurii Leonidovich Ershov; Yuri L. Ershov
Choose the list to add your product or create one New List
✓ Product added successfully to the Wishlist.
Go to My Wishlists
Origin: U.S.A.
(Import costs included in the price)
It will be shipped from our warehouse between
Thursday, June 20 and
Monday, July 08.
You will receive it anywhere in United Kingdom between 1 and 3 business days after shipment.
Synopsis "Definability and Computability (Siberian School of Algebra and Logic)"
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.
- 0% (0)
- 0% (0)
- 0% (0)
- 0% (0)
- 0% (0)
All books in our catalog are Original.
The book is written in English.
The binding of this edition is Hardcover.
✓ Producto agregado correctamente al carro, Ir a Pagar.