Recomienda este artículo a tus amigos:
Recursive Functions and Metamathematics: Problems of Completeness and Decidability, Goedel's Theorems - Synthese Library Roman Murawski 1999 edition
Recursive Functions and Metamathematics: Problems of Completeness and Decidability, Goedel's Theorems - Synthese Library
Roman Murawski
Recursive Functions and Metamathematics deals with problems of the completeness and decidability of theories, using as its main tool the theory of recursive functions. Recent results and trends have been included, such as undecidable sentences of mathematical content, reverse mathematics.
395 pages, biography
| Medios de comunicación | Libros Hardcover Book (Libro con lomo y cubierta duros) |
| Publicado | 30 de septiembre de 1999 |
| ISBN13 | 9780792359043 |
| Editores | Springer |
| Páginas | 395 |
| Dimensiones | 156 × 234 × 23 mm · 757 g |
| Lengua | Inglés |
Mas por Roman Murawski
Mostrar todoMere med samme udgiver
Ver todo de Roman Murawski ( Ej. Hardcover Book y Paperback Book )