Faites connaître cet article à vos amis:
Recursive Functions and Metamathematics: Problems of Completeness and Decidability, Goedel's Theorems - Synthese Library Roman Murawski Softcover reprint of hardcover 1st ed. 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.
407 pages, biography
| Médias | Livres Paperback Book (Livre avec couverture souple et dos collé) |
| Validé | 6 décembre 2010 |
| ISBN13 | 9789048152988 |
| Éditeurs | Springer |
| Pages | 395 |
| Dimensions | 155 × 235 × 21 mm · 566 g |
Plus par Roman Murawski
Afficher toutVoir tous les Roman Murawski ( par ex. Hardcover Book et Paperback Book )
Les cadeaux de Noël peuvent être échangés jusqu'au 31 janvier