In my opinion it is uncountable since we can think every natural number as a member of one alphabet like $\quad0\in\sum_0 ,1\in \sum_1, ... \quad$ And there are also other symbols than natural numbers in alphabets. So there is no possible 1:1 and onto mapping from set of all alphabets to natural numbers. Thus they cannot be enumerated which means they are uncountable. Is there anything wrong with my approach?
Is the set of all possible finite alphabets uncountable?
formal languages