Goedel's Famous Proof
Kurt Goedel shattered the hopes of mathematicians who aimed to create a comprehensive formal theory under which all true statements of mathematics could be proved by proving that such a system could not exist. This incompleteness theorem has repercussions for computer science, since a limitation on formal systems is also a limitation on computer programs.
Martin Herzel has provided a translation of Goedel's famous proof from German to English and from Goedel's notation to more familiar contemporary notation. After reading about this proof from numerous other sources, it's great to be able to read it (almost) directly myself.