In article <firstname.lastname@example.org>, WM <email@example.com> wrote:
> 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.
But you must show that it can be counted.
And there are sets which can be shown cannot be counted.
When a set is countably infinite, its power set is provably not countable. --