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 TerkaitSystemctl command to display a summary of running services – askubuntu.comIs it a substring of itself? – codegolf.stackexchange.comThe 'directionality' of reductions? – cs.stackexchange.com12v Input on 3v3 GPIO, TVS pulled down or Schottky pull up? – electronics.stackexchange.comModern C++: initialize constexpr tables – stackoverflow.comWhy is it better for an iPhone’s battery to NOT close down apps? – apple.stackexchange.com
0 Comment to "How many uncountable subsets of power set of integers are there? – math.stackexchange.com"
Post a Comment