Hey cool, you're getting interested in math!

You're right about the existence of a transfinite set with an infinite cardinality actually; it's just that I had not ever seen anything aside from the usual
À0 and
À1 in analysis textbooks, but I guess those only cover the set theory necessary for analysis proofs and don't go too in depth.

Since the symbol ¥ is all tied up with the integers and rationals generally, another is used for the reals, C, standing for continuum (because all the reals can, of course, be put into a one-to-one correspondence with all of the points on a line, which is a continuum). This new level of endlessness C is different and more intensely endless than the set of "ordinary infinity," ¥. It is believed that C is equivalent to À1, but it has also been shown that this is impossible to prove.
Ah, that's the famous continuum hypothesis; as you said, this is a decidedly indeterminate proposition, and at least one more axiom is needed to add to the conventional zermelo-fraenkel axioms to prove or disprove this. Cantor thought that it should be true, but the general consensus today among the mathematical community seems to be that the hypothesis is false and that there exist sets with cardinalities greater than that of the usual continuum that cannot be put to a one-to-one correspondence with the real numbers. Do you think this should be true or not?
Now, one of the interesting properties of the transfinites is that the only way to produce any change in a transfinite is to raise it by the power of of a transfinite equal or greater value. Raising a transfinite by a power equal to itself causes the transfinite to be raised to the next transfinite level. Thus:
À0^À0=À1, À1^À1=À2, ...
If C does equal À1, that makes ¥^¥=C.
I didn't know any of that before; thanks for bringing it to my attention. So the continuum hypothesis could be restated as C^C=C.
On a side note, since you seem to know some stuff about transfinite set theory, do you know if the equinumerability of all sets with cardinality
À0 is another of those undecidable Gödel statements? For example, a special case of this is that the number of natural numbers is equal to the number of perfect squares. We all know of the one-to-one correspondence proof, but the following statement also appears to hold:
Let N denote the set of natural numbers, S denote the set of perfect squares of natural numbers and E(s) be a general function that returns the number of elements in a set.
E( x | x
ÎN /\ x
ÏS )
¹ E( x | x
ÎS /\ x
ÏN )
In other words, the set of all numbers that are in N but not in S should be equal to the set of all numbers that are in S but not in N, and this property obviously holds for any two equinumberable finite sets. Of course, there are pairs of sets that have different numbers of elements and still satisfy that property, but it can be shown that all equinumerable sets must satisfy it, and so this is a necessary but not a sufficient condition for the sets to have any equal number of elements. However, we also know that there exist natural numbers that are not squares, and also that there are no squares that are not naturals as well. Therefore, N and S would not be equinumerable, because the E( x | x
ÎN /\ x
ÏS ) set will have more elements than the E( x | x
ÎS /\ x
ÏN ) (which would be equal to
Æ), but this contradicts the original assumption.
Additionally, there is a result from analysis that the average asymptotic density of the squares over the real line is less that of the natural numbers and also continuously decreases while going to infinity.
I'm not all that familiar with this set theory stuff (I am more of a pure analysis guy

), so you might know what is going on here.