How many uncountable subsets of power set of integers are there? – math.stackexchange.com 09:35 Posted by Unknown No Comments The question is to determine how many uncountable subsets of ${P(\mathbb Z)}$ are there. I think that the answer is $2^c$. Let $A=\{B\in P(P(\mathbb Z)):B \text{ is uncountable}\}$ $P(P(\mathbb ... from Hot Questions - Stack Exchange OnStackOverflow via Blogspot Share this Google Facebook Twitter More Digg Linkedin Stumbleupon Delicious Tumblr BufferApp Pocket Evernote Unknown Artikel TerkaitHistoric-geographic spread and variations of the children's rhyme "My friend Billy had a 10-foot willy" – mythology.stackexchange.comtetrahedron die probability – math.stackexchange.comCarbocation rearrangement involving three membered rings – chemistry.stackexchange.comHow do helicopters avoid colliding? – aviation.stackexchange.comWhy does it make any physical sense for a body to have negative potential energy? – physics.stackexchange.comMay I sort the /etc/group and /etc/passwd files? – unix.stackexchange.com
0 Comment to "How many uncountable subsets of power set of integers are there? – math.stackexchange.com"
Post a Comment