This is the question : Prove that the set of all the words in the English language is countble (the set's cardinality is אo) A word is defined as a finite sequence of letters in the English language.
I'm not really sure how to start this. I know that a finite union of countble sets is countble and i think this is the way to start.
Thanks in advance !