Compartir
Definability and Computability (Siberian School of Algebra and Logic)
Iurii Leonidovich Ershov; Yuri L. Ershov (Autor)
·
Springer
· Tapa Dura
Definability and Computability (Siberian School of Algebra and Logic) - Iurii Leonidovich Ershov; Yuri L. Ershov
Sin Stock
Te enviaremos un correo cuando el libro vuelva a estar disponible
Reseña del libro "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)
Todos los libros de nuestro catálogo son Originales.
El libro está escrito en Inglés.
La encuadernación de esta edición es Tapa Dura.
✓ Producto agregado correctamente al carro, Ir a Pagar.