A Computer Science Version of Gödel's Theorem (Goedel's Theorem)
✍ Scribed by Bruce J. MacLennan
- Publisher
- Defense Technical Information Center
- Year
- 1983
- Tongue
- English
- Leaves
- 22
- Series
- DTIC_ADA132903, Naval Postgraduate School, NPS52-83-010
- Category
- Library
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
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
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
considered a "concise," "modern classic" by Peter Smith, author of [*An Introduction to Gödel's Theorems*](http://www.godelbook.net/)