Godels Incompleteness Theorem (Little Mathematics Library)

Shared by Archive Librarian • computer science, mathematics. logic, godel • 1987

Few discoveries have had as much impact on our perception of human thought as Gödel’s proof in 1930 that any logical system such as usual rules of arithmetic, must be inevitably incomplete, i.e. , must contain statements which are true but can never be proved. Professor Uspensky’s makes both a precise statement and also a proof of Gödel’s startling theorem understandable to someone without any advanced mathematical training, such as college students or even ambitious high school student. Also, Uspensky introduces a new method of proving the theorem, based on the theory of algorithms which is t