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 TerkaitHow could a planet have zero surface caves? – worldbuilding.stackexchange.comCompress a sparse matrix – codegolf.stackexchange.comHow is Themiscyra populated? – movies.stackexchange.comCan you throw back a bomb thrown by an alchemist with Snatch Arrows? – rpg.stackexchange.comHow to properly divide beamer slide in two sections – tex.stackexchange.comIt was just an input-bug – codegolf.stackexchange.com
0 Comment to "How many uncountable subsets of power set of integers are there? – math.stackexchange.com"
Post a Comment