Gödel's incompleteness theorem/ V. A. Uspensky
Material type:
- 23 511.3 Us84
Item type | Current library | Call number | Status | Date due | Barcode | Item holds | |
---|---|---|---|---|---|---|---|
Books | ISI Library, Kolkata | 511.3 Us84 (Browse shelf(Opens below)) | Available | E2836 |
Browsing ISI Library, Kolkata shelves Close shelf browser (Hides shelf browser)
No cover image available | No cover image available | |||||||
511.3 T843 Constructivsm in mathematics : an introduction | 511.3 T843 Basic proof theory | 511.3 Un61 Classification theory | 511.3 Us84 Gödel's incompleteness theorem/ | 511.3 V111 Dependence logic | 511.3 V672 Labelled non-classical logics | 511.3 V884 Modular construction and partial order semantics of petri nets |
Translated from the Russian by Neal Koblitz
Includes bibliography
Preface -- Statement of the problem -- Basic conceps from the theory of algorithms and their application -- The simplest incompleteness criteria -- The language of arithmatic -- Three axioms for the theory of algorithms
There are no comments on this title.