@Arjun sir, I think this should be added under TOC rather than Set Theory.

Dark Mode

7,651 views

30 votes

Let $\Sigma$ be a finite non-empty alphabet and let $2^{\Sigma^*}$ be the power set of $\Sigma^*$. Which one of the following is **TRUE**?

- Both $2^{\Sigma^*}$ and $\Sigma^*$ are countable
- $2^{\Sigma^*}$ is countable and $\Sigma^*$ is uncountable
- $2^{\Sigma^*}$ is uncountable and $\Sigma^*$ is countable
- Both $2^{\Sigma^*}$ and $\Sigma^*$ are uncountable

edited
Oct 26, 2022
by Pranavpurkar

0