Jump to content

Blog post: pengkuan: On the uncountability of the power set of ?

SFN Blogs
in SFN Blogs

Featured Replies

This article discusses the uncountability of the power set of ? proven by using the out-indexes subset contradiction. Cantor's theorem proves that the power set of ? is uncountable. This is a proof by contradiction. Suppose that the power set of ? is countable. This allows us to put all subsets of ? in a list. The contradiction will come from the indexes.

 

Please read the article at

 

PDF On the uncountability of the power set of ?

http://pengkuanonmaths.blogspot.com/2016/02/on-uncountability-of-power-set-of.html

or Word https://www.academia.edu/21601620/On_the_uncountability_of_the_power_set_of_N


Read and comment on the full post

Archived

This topic is now archived and is closed to further replies.

Go to topic listing

Important Information

We have placed cookies on your device to help make this website better. You can adjust your cookie settings, otherwise we'll assume you're okay to continue.

Configure browser push notifications
Chrome (Android)
  1. Tap the lock icon next to the address bar.
  2. Tap Permissions → Notifications.
  3. Adjust your preference.
Chrome (Desktop)
  1. Click the padlock icon in the address bar.
  2. Select Site settings.
  3. Find Notifications and adjust your preference.