| |
| | Cantor's Diagonal Argument |
 | | The classic form of the argument goes as follows: given a mapping (N f :{mapping (N:{0,1})}) there is a mapping g defined by; g(i) = not(f(i,i)) where ({0,1}: not :{0,1}) swaps 0 <-> 1; clearly, g isn't f(i) for any i in N, since, by construction, it is distinguishable from each. |
 | | That set a revolution in motion which came to its resolution, via the heroics of Russel, Whitehead and their peers, in the work of Kurt Gödel. Listen closely, and you may be able to hear the first pre-echoes of Gödel's fork somewhere in the background of the saga's first breakthrough. |
 | | The crucial property of the diagonal argument is that f(N) is not a member of {f(n) : n in N}. |
| www.chaos.org.uk /~eddy/math/diagonal.html (834 words) |
|