Re: Incompleteness of Cantor's enumeration of the rational numbers (extra-ordinary)

Liste des GroupesRevenir à s math 
Sujet : Re: Incompleteness of Cantor's enumeration of the rational numbers (extra-ordinary)
De : richard (at) *nospam* damon-family.org (Richard Damon)
Groupes : sci.logic
Date : 17. Dec 2024, 00:57:59
Autres entêtes
Organisation : i2pn2 (i2pn.org)
Message-ID : <4efa80aa8ba6633e37130c0374e2f44d4c89c8a3@i2pn2.org>
References : 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28
User-Agent : Mozilla Thunderbird
On 12/16/24 3:59 AM, WM wrote:
On 15.12.2024 22:14, Richard Damon wrote:
On 12/15/24 2:44 PM, WM wrote:
On 15.12.2024 13:54, Richard Damon wrote:
>
You can't "name" your dark numbers,
>
because they are dark.
 
|ℕ \ {1, 2, 3, ...}| = 0 cannot be accomplished by visible numbers because ∀n ∈ ℕ_def: |ℕ \ {1, 2, 3, ..., n}| = ℵo.
 
Which just shows that the full set in infinte, and any member in it is finite, and not the last member.
 Many members can be subtracted individually but infinitely many members cannot be subtracted individually. They are belonging to the set. They are dark.
 Regards, WM
 
Sure an infinite number of members can be subtracted individually, if you logic allows for infinite operations.
Since yours doesn't you run into the problem that you never got the set of the Natural Numbers in the first place, so you system just colapses on its own lies.

Date Sujet#  Auteur
21 Jul 25 o 

Haut de la page

Les messages affichés proviennent d'usenet.

NewsPortal