Ar kodu EXTRA500,75 cena tikai €
556,39 €
Definability and Computability
500,75 € 
- Mēs nosūtīsim 10-14 darba dienu laikā.
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…
500.75
2025-06-02 08:00:00
/images/books/3011776/9780306110399.jpg)
- Autors: Yuri L Ershov
- Izdevējs Springer
- Gads: 1996
- ISBN-10 : 0306110393
- ISBN-13 : 9780306110399
- Formāts: 17.6 x 23.1 x 2.2 cm, kieti viršeliai
- Valoda: Anglų
- Extra -10% atlaide, ievadot kodu: EXTRA
Atsauksmes
Apraksts
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.10 EXTRA % atlaide
500,75 €
556,39 €
Mēs nosūtīsim 10-14 darba dienu laikā.
Kupona kods: EXTRA
Akcija beidzas 7d.07:46:07
Atlaides kods derīgs pirkumiem no 10 €. Atlaides nav kumulatīvas.
Derīgs tikai pirkumiem tiešsaistē.
- Autors: Yuri L Ershov
- Izdevējs Springer
- Gads: 1996
- ISBN-10: 0306110393
- ISBN-13: 9780306110399
- Formāts 17.6 x 23.1 x 2.2 cm, kieti viršeliai
- Valoda: Anglų
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.
Atsauksmes