On 7 Apr., 20:00, Dan <dan.ms.ch...@gmail.com> wrote:
> So , we have a set that you can't count (all meaningful finite > sentences of words , it's simply too complex for you to count) , stuck > inside a set you can count (all random words/sequences of > letters) .
You need not count a set in order to prove its countability. A subset of a countable set is countable in set theory and wherever countability appears to be a meaningful notion. You cannot save uncountability in set theory after violating this theorem.