We know set A is countable if A is finite or in a one-to-one mapping to natural numbers.
I try to summarize my though. I think the following proposition is true. suppose $\Sigma$ is arbitrary alphabet. every one would please help me and add some hints for each one, or if I'm wrong correct me !! thanks to all.
1) Each arbitrary Language on $\Sigma$ is Countable.
2) the set of all language from $\Sigma$ is Countable.
3) for Each arbitrary Language on $\Sigma$ we have a generative formal grammar.
4) Each arbitrary Language on $\Sigma$ that generated by formal grammar, is recursive.