
Fortell venner om denne varen:
Recursive Functions and Metamathematics: Problems of Completeness and Decidability, Goedel's Theorems - Synthese Library 1999 edition
Roman Murawski
Pris
元 1.216
Bestillingsvarer
Forventes levert 15. - 23. jul
Legg til iMusic ønskeliste
Eller
Finnes også som:
Recursive Functions and Metamathematics: Problems of Completeness and Decidability, Goedel's Theorems - Synthese Library 1999 edition
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
Media | Bøker Innbunden bok (Bok med hard rygg og stivt omslag) |
Utgitt | 30. september 1999 |
ISBN13 | 9780792359043 |
Utgivere | Springer |
Antall sider | 395 |
Mål | 156 × 234 × 23 mm · 757 g |
Språk | Engelsk |