Tipsa dina vänner om produkten:
Recursive Functions and Metamathematics: Problems of Completeness and Decidability, Goedel's Theorems - Synthese Library Roman Murawski Softcover reprint of hardcover 1st ed. 1999 edition
Pris
SEK 1.669
Beställningsvara
Förväntad leverans 7 - 15 jan 2026
Julklappar kan bytas fram till 31:e januari
Lägg till din iMusic-önskelista
eller
Finns även som:
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 | Böcker Pocketbok (Bok med mjukt omslag och limmad rygg) |
| Releasedatum | 6 december 2010 |
| ISBN13 | 9789048152988 |
| Utgivare | Springer |
| Antal sidor | 395 |
| Mått | 155 × 235 × 21 mm · 566 g |
Fler produkter med Roman Murawski
Visa allaSe alt med Roman Murawski ( t.ex. Inbunden Bok och Pocketbok )