Godel's Incompleteness Theorems

Front Cover
Oxford University Press, Aug 20, 1992 - Computers - 160 pages
0 Reviews
Kurt Godel, the greatest logician of our time, startled the world of mathematics in 1931 with his Theorem of Undecidability, which showed that some statements in mathematics are inherently "undecidable." His work on the completeness of logic, the incompleteness of number theory, and the consistency of the axiom of choice and the continuum theory brought him further worldwide fame. In this introductory volume, Raymond Smullyan, himself a well-known logician, guides the reader through the fascinating world of Godel's incompleteness theorems. The level of presentation is suitable for anyone with a basic acquaintance with mathematical logic. As a clear, concise introduction to a difficult but essential subject, the book will appeal to mathematicians, philosophers, and computer scientists.
 

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

I
1
II
5
III
10
IV
14
V
17
VI
19
VII
20
VIII
22
XXX
81
XXXI
82
XXXII
84
XXXIII
86
XXXIV
90
XXXV
93
XXXVI
96
XXXVII
97

IX
24
X
28
XI
30
XIII
33
XIV
36
XV
40
XVI
43
XVII
45
XVIII
46
XIX
49
XX
50
XXI
56
XXII
58
XXIII
61
XXIV
66
XXV
68
XXVI
73
XXVII
75
XXVIII
76
XXIX
77
XXXVIII
98
XXXIX
100
XL
102
XLI
104
XLII
106
XLIII
108
XLIV
109
XLV
112
XLVI
116
XLVII
117
XLVIII
120
XLIX
122
L
124
LI
126
LII
129
LIII
132
LIV
136
LV
138
Copyright

Other editions - View all

Common terms and phrases

References to this book

All Book Search results »

Bibliographic information