In article <firstname.lastname@example.org>, WM <email@example.com> wrote:
> On 6 Feb., 00:31, Virgil <vir...@ligriv.com> wrote: > > In article > > <3ffb012f-81a5-410d-8257-f8eee410a...@e10g2000vbv.googlegroups.com>, > > > > WM <mueck...@rz.fh-augsburg.de> wrote: > > > But how to pick this dark matter of numbers? Only accessible > > > numbers can get picked. Unpickable numbers cannot appear > > > anywhere, neither in mathematics nor in Cantor's lists. Therefore > > > Cantor "proves" that the pickable numbers, for instance numbers > > > that can appear as an antidiagonal of a defined list, i.e., the > > > countable numbers, are uncountable. > > > > Nonsense! > > > > What Cantor proved was that no list of accessible real numbers > > (accessible because listable) can include all accessible numbers, > > because any such list itself proves the existence of accessible > > numbers not originally listed.
Thus every accessible number can appear in SOME list of accessible numbers, but for every such list there is at least one accessible number not in it.
Thus no surjection from |N to the set of all accessible reals numbers. > > Correct. And König proved (or at least knew the fact) that the set of > accessible numbers is countable.
If countable implies completely listable, then he did no such thing. --