Godels Incompleteness Theorem (Little Mathematics Library) | V. A. Uspensky
Godels Incompleteness Theorem (Little Mathematics Library)
User Rating: Be the first one!
Author: V. A. Uspensky
Added by: mirtitles
Added Date: 2013-08-15
Publication Date: 1987
Language: eng
Subjects: mathematics. logic, godel, incompleteness theorem, mir publishers, propositional calculus, deductive theory, algorithms
Publishers: Mir Publishers
Collections: mir-titles, additional collections
Pages Count: 600
PPI Count: 600
PDF Count: 1
Total Size: 37.00 MB
PDF Size: 8.63 MB
Extensions: torrent, djvu, epub, gif, pdf, gz, zip
Year: 1987
Contributor: Mirtitles
Downloads: 7.41K
Views: 57.41
Total Files: 14
Media Type: texts
Description
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 taking on increasing importance in modern mathematics because of its connection with computers. This book is recommended for students of mathematics, computer science, and philosophy and for scientific layman interested in logical problems of deductive thought.