Likes+6,26321

Godels Incompleteness Theorem (Little Mathematics Library) | |
---|---|

Original Title | Godels Incompleteness Theorem (Little Mathematics Library) |

Author | V. A. Uspensky |

Publication date |
1987 |

Topics | mathematics. logic, godel, incompleteness theorem, mir publishers, propositional calculus, deductive theory, algorithms |

Publisher | Mir Publishers |

Collection | mir-titles, additional_collections |

Contributor | Mirtitles |

Language | English |

Book Type | EBook |

Material Type | Book |

File Type | |

Downloadable | Yes |

Support | Mobile, Desktop, Tablet |

Scan Quality: | Best No watermark |

PDF Quality: | Good |

Availability | Yes |

Price | 0.00 |

Submitted By | mirtitles |

Submit Date | |

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. |

Godels Incompleteness Theorem (Little Mathematics Library)
| V. A. Uspensky

Godels Incompleteness Theorem (Little Mathematics Library) Original Title Godels Incomplet

Godels Incompleteness Theorem (Little Mathematics Library)
| V. A. Uspensky

Godels Incompleteness Theorem (Little Mathematics Library) Original Title Godels Incomplet