The Man said:
Again unless you can show what member of a set is not a member of that set, then you can not show that set, as defined, to be incomplete. That there may be "an object" that is not a member of that set in no way makes that set, as defined, incomplete.
<0,1> is the minimal needed form in order to translate any given object of a given collection into a unique code.
By doing this we are able to show a universal property of any given collection, which can't be seen form the level of each collection separately (The Man calls this separation "as defined" or in other words, he can't get the notion of cross-context level among context-dependent levels).
<0,1> form is used as the universal code for any given collection, as follows:
1) Each <0,1> form is an infinitely long unique code between 00000.... and 11111... , where 00000.... and 11111... are also unique codes.
2) We read each unique code from left to right.
jsfisher said:
Don't lie. You did no such thing. For three possibilities, you demanded that the bit maps all be of the form xxx00000 so you could get 8 bits in each of the 8 possibilities. You, very literally, excluded anything with 1's after the first three bits. Why, then, are you surprised values you explicitly excluded aren't in the collection?
Please read (1) above, in order to realize that you are wrong.
----------------------
Some examples of <0,1> translations:
A) Natural numbers (notated as
N) <0,1> translation (where by Peano axioms, 0 is a natural number (
http://en.wikipedia.org/wiki/Peano_axioms )):
00000000000... ↔ 0
10000000000... ↔ 1
01000000000... ↔ 2
00100000000... ↔ 3
00010000000... ↔ 4
00001000000... ↔ 5
etc. ad infinitum ...
B) The power set of
N ( notated as P(
N) ) that includes {},{1,2,3,...} and any object between {} and {1,2,3,...}, is translatable to <0,1> form, for example:
{
00000000000... ↔ { },
11000000000... ↔ {1,2},
10000000000... ↔ {1},
10101010100... ↔ odd numbers {1,3,5,...},
10100000000... ↔ {1,3},
01010101010... ↔ even numbers {2,4,6,...},
01000000000... ↔ {2},
01100000000... ↔ {2,3},
00100000000... ↔ {3},
11111111111... ↔
N numbers {1,2,3,...},
...
}
etc. ad infinitum ...
C) The power set of P(
N) ( notated as P(P(
N)) ) that includes {} , {{},{{}},{1},{2},{3},{4},{5},{6},...} and any object between {} and {{},{{}},{1},{2},{3},{4},{5},{6},...}, is translatable to <0,1> form, for example:
{
000000000000... ↔ {},
100000000000... ↔ {{}},
010000000000... ↔ {{1}},
001000000000... ↔ {{2}},
000100000000... ↔ {{3}},
110000000000... ↔ {{},{1}},
101000000000... ↔ {{},{2}},
100100000000... ↔ {{},{3}},
111111111111... ↔ {{},{{}},{1},{2},{3},{4},{5},{6},{7},{8},{9},...},
...
}
etc. ad infinitum ...
A,B,C,... <0,1> translation is true by induction.
Given X, P(X), P(P(X)), ... , ...P(P(P(X)))... that are translatable to <0,1> collections of unique forms, it is shown that the inverse of the diagonal of the collection of the <0,1> unique forms, is not in the range of the given collection.
Since the inverse of the diagonal of the collection of the <0,1> unique forms has the same property of the unique forms of the given collection AND it is not in the range of the given collection, we conclude that any given collection of <0,1> unique forms is incomplete.
----------------------
EDIT:
Some examples (by universality only the <0,1> unique forms are significant):
00000000000...
1
0000000000...
01
000000000...
001
00000000...
0001
0000000...
00001
000000...
where the <0,1> distinct form that is not in the range starts with
1111111..., in this case.
{
00000000000...
1
1000000000...
10
000000000...
101
01010100...
1010
0000000...
01010
101010...
010000
00000...
0110000
0000...
00100000
000...
111111111
11...
...
}
where the <0,1> distinct form that is not in the range starts with
1011101110..., in this case.
{
00000000000...
1
0000000000...
01
000000000...
001
00000000...
0001
0000000...
11000
000000...
101000
00000...
1001000
0000...
11111111
111...
...
}
where the <0,1> distinct form that is not in the range starts with
111111110..., in this case.
-----------------------
jsfisher and The Man still can't grasp the incompleteness of any given collection, which is translatable to <0,1> unique forms.
EDIT:
Again The Man:
You still can't get the beauty of the complementarity of the invariat and the variant under a one framework.
For example: If you change the order of some collection of <0,1> unique forms, you get different <0,1> inverse form of the diagonal of that collection, which is not in the range of that given collection.
Yet, not being in the range is invariant w.r.t any ordered case of collections of <0,1> forms.
Actually given any defined formula, it is invariant w.r.t any particular solution of it.