Cantors diagonalization argument

aaaa202
Messages
1,144
Reaction score
2
I am sure you are all familiar with this. The number generated by picking different integers along the diagonal is different from all other numbers previously on the list. But you could just put this number as next element on the list. Of course that just creates a new number which is missed, but if you successively kept putting the number missed as indicated by the diagonal wouldn't you eventually hit all real numbers on the interval (0,1)? I mean isn't it the same as saying that we haven't hit the rational number 5/32 but that it is coming later in the sequence we use to pair the rationals with natural numbers.
 
Physics news on Phys.org
"I am sure you are all familiar with this. The number generated by picking different integers along the diagonal is different from all other numbers previously on the list. "

Partially true. Remember, you made the list by assuming the numbers between 0 and 1 form a countable set, so can be placed in order from smallest to largest, and so your list already contains all of those numbers.
Now, when you go down the diagonal to create the new number, the procedure discussed does not stop at any particular row (say the 500th). Instead, it shows you can go down all rows, creating a number that is different from EVERY other number in your (assumed to be complete) list. So now you have this:

* You assumed you could list every possible number, and that you have done so
* You find out your assumption was wrong

That is the key to the argument.
 
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Thread 'Detail of Diagonalization Lemma'
The following is more or less taken from page 6 of C. Smorynski's "Self-Reference and Modal Logic". (Springer, 1985) (I couldn't get raised brackets to indicate codification (Gödel numbering), so I use a box. The overline is assigning a name. The detail I would like clarification on is in the second step in the last line, where we have an m-overlined, and we substitute the expression for m. Are we saying that the name of a coded term is the same as the coded term? Thanks in advance.

Similar threads

Back
Top