Definability and Computability
(Sprache: Englisch)
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...
Leider schon ausverkauft
versandkostenfrei
Buch (Gebunden)
Fr. 367.90
inkl. MwSt.
- Kreditkarte, Paypal, Rechnungskauf
- 30 Tage Widerrufsrecht
Produktdetails
Produktinformationen zu „Definability and Computability “
Klappentext zu „Definability and Computability “
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.
Inhaltsverzeichnis zu „Definability and Computability “
Sigmadefinability and the Gödel Incompleteness Theorem. Computability on Admissible Sets. Selected Topics. Appendix. Index.
Bibliographische Angaben
- Autor: Yuri L. Ershov
- 1996, 1996., 264 Seiten, Masse: 16 x 24,1 cm, Gebunden, Englisch
- Verlag: Springer
- ISBN-10: 0306110393
- ISBN-13: 9780306110399
- Erscheinungsdatum: 30.04.1996
Sprache:
Englisch
Kommentar zu "Definability and Computability"
0 Gebrauchte Artikel zu „Definability and Computability“
| Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
|---|
Schreiben Sie einen Kommentar zu "Definability and Computability".
Kommentar verfassen