set?The paradox is from that,the power of the set of all elements is the strongest,how about the elemets of its all subsets?There is teorem:the power of subsets of a set always stronger than the set.How check the power?We use mopping to check......與 finite, infinite you關.
Set Y always not belong to Y.Do you know power of a
所有跟帖:
• that is not paradox:the power of subsets of a set always stronge -皆兄弟也- ♂ (0 bytes) () 07/24/2010 postreply 14:26:46
• you're smart,but can't make sence of my statement. -jinjing- ♀ (0 bytes) () 07/24/2010 postreply 14:37:37