Autorenfreundlich Bücher kaufen?!
Beschreibung
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.
Details
| Verlag | Springer US |
| Ersterscheinung | 30. April 1996 |
| Maße | 23.4 cm x 15.6 cm |
| Gewicht | 594 Gramm |
| Format | Hardcover |
| ISBN-13 | 9780306110399 |
| Seiten | 264 |
Schlagwörter
Herstellerinformationen
Bekannt durch
