Tell your friends about this item:
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
| Media | Books Paperback Book (Book with soft cover and glued back) |
| Released | December 6, 2010 |
| ISBN13 | 9789048152988 |
| Publishers | Springer |
| Pages | 395 |
| Dimensions | 155 × 235 × 21 mm · 566 g |
More by Roman Murawski
Show allSee all of Roman Murawski ( e.g. Hardcover Book and Paperback Book )
Christmas presents can be returned until 31 January