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 TerkaitWhy is a "reputation" required to ask a question about Windows 10? – meta.stackexchange.comSignificance of pop songs with progressions that alternate one chord with one that's three semitones below it – music.stackexchange.comWhy might modern demigods be unable to use guns? – worldbuilding.stackexchange.comWhat is it that I look for? – puzzling.stackexchange.comWhy non-constant static variables need to be initialized outside the class? – stackoverflow.comWhat is the answer to this infamous "Common Core" question? – math.stackexchange.com
0 Comment to "How many uncountable subsets of power set of integers are there? – math.stackexchange.com"
Post a Comment