It happened to mathematics first.
If you speak about non-Euclidian geometry then you right but what about QM and Bohr's complementary attitude?
(e.g. admitting that the set of real numbers satisfies the definition of "uncountable", yet in the same breath you assert that the set of real numbers is not "uncountable")
No, N and R are enumerable by my definitions because my aleph0 is not your aleph0, no more no less.
Also I see that you don't understand my post about the difference between Cantor's aleph0 and my aleph0.
So, here it is again, but please this time stop on each part of it and please ask me about it, if you think that you don't understand it, thank you:
Dear Hurkyl (this time please answer to this post),
My basic approach about the infinity concept is that redundancy and uncertainty are naturally involved, no more no less.
Therefore aleph0 is a notation that stands for general and flexible "cloud like" thing.
Cantor's thing is a frozen one, mine is not.
I think that my approach is much more interesting and fruitful than Cantor's approach.
Please let me put these two different approaches "on the table" and I would like to examine them together with you.
I am going to write my point of view on Cantor’s approach in a very simple way that (I hope) can be understood by you.
Please read it, and open my eyes to important things that I omit, don’t understand, distorting and so on.
So here it is:
1) Let set C be a complete non-empty binary tree where complete non-empty binary tree exists iff both root AND all its leafs are in C.
2) Let RT be the root , let LF be the all leafs,
therefore RT AND LF are in C --> [RT , LF].
( In my point of view RT XOR LF are in C --> ( (RT… , …LF) OR (LT… , LF] OR
[RT ,…LF) ) AND NOT [RT , LF] where “…” means unreachable. )
Now, from my point of view I see these basic problems when RT AND LF are in C:
1) If both RT AND LF are in C, then C must be a finite set.
2) If C is a non-finite set (through my point of view C is forced to be a non-finite set) then the base value 2 (which is the fundamental structural property of the non-empty binary-tree) cannot exist. Also RT value is unknown.
We must realize that if RT AND LF are in C AND C is a non-finite set, then the structural property of our information (in this case we are talking about the binary tree structure) collapsed into itself (we have no infinitely many elements anymore) and cannot be used as an input by Math language .
Therefore the expression 2^aleph0 cannot exist and we cannot construct
the transfinite universes.
Shortly speaking, what is called uncountable is not uncountable but simply does not exist in any form of input that can be used by Math language.
Through my point of view base 2 can exit
iff (C is finite) OR (RT XOR LF are in C)
Please show me how C is a non-finite set where
(RT AND LF are in C) AND (base 2 exists --> binary tree exists).
Also please tell me what is the value of RT when RT AND LF are in C AND C is a non-finite set.