Abstract
The article deals with Cantor?s argument for the non-denumerability of reals somewhat in the spirit of Lakatos? logic of mathematical discovery. At the outset Cantor?s proof is compared with some other famous proofs such as Dedekind?s recursion theorem (RT), showing that rather than usual proofs they are resolutions to do things differently.
Based on this I argue that there are ?ontologically? safer ways of developing the diagonal argument into a full-fledged theory of continuum, concluding eventually that famous semantic paradoxes based on diagonal construction are caused by superficial understanding of what a name is.