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 TerkaitAdding the third floppy drive? – retrocomputing.stackexchange.comIs there anything in D&D 5e that cancels out Small creatures' disadvantage to attack when using Heavy weapons? – rpg.stackexchange.comRiddle: "What will become of me?" – puzzling.stackexchange.comIs it acceptable to use kanji and hiragana in the same word if a kanji character is unknown? – japanese.stackexchange.comWhy would Wolverine be needed to greenlight Deadpool movie? – scifi.stackexchange.comCircuit breaker adjustment – diy.stackexchange.com
0 Comment to "How many uncountable subsets of power set of integers are there? – math.stackexchange.com"
Post a Comment