| Deutsch English Français Italiano |
|
<ed7c39e15e18de4498880a0035735ebbacd9a325@i2pn2.org> View for Bookmarking (what is this?) Look up another Usenet article |
Path: ...!weretis.net!feeder9.news.weretis.net!news.nk.ca!rocksolid2!i2pn2.org!.POSTED!not-for-mail From: joes <noreply@example.org> Newsgroups: sci.math Subject: Re: Incompleteness of Cantor's enumeration of the rational numbers Date: Thu, 21 Nov 2024 00:08:24 -0000 (UTC) Organization: i2pn2 (i2pn.org) Message-ID: <ed7c39e15e18de4498880a0035735ebbacd9a325@i2pn2.org> References: <vg7cp8$9jka$1@dont-email.me> <vh4itg$2o3vu$1@dont-email.me> <8165b44b-1ba5-429d-8317-0b043b214b53@att.net> <vh76bi$3bnde$1@dont-email.me> <d90452a5-965b-443f-9146-96cdf9b3906c@att.net> <vh8ft0$3jqb5$3@dont-email.me> <vh8g5e$3juug$1@dont-email.me> <vh8otd$3lhlt$2@dont-email.me> <vhb1is$6hbv$2@dont-email.me> <vhb1mu$6hbv$4@dont-email.me> <vhb32t$7ese$1@dont-email.me> <vhch7n$hge9$2@dont-email.me> <vhcieh$jjk5$1@dont-email.me> <vhcjg5$hdd4$3@dont-email.me> <vhckkh$k32g$1@dont-email.me> <vhcp0r$hge9$6@dont-email.me> <vhd7d7$nt37$1@dont-email.me> <vhd9lq$obb0$1@dont-email.me> <vhdl0k$qltl$1@dont-email.me> <vhfqcv$1adld$1@dont-email.me> <vhfso7$1bik6$1@dont-email.me> <vhg0h8$1adlc$4@dont-email.me> <vhgd9j$1eq8t$1@dont-email.me> <vhgebm$1eu67$2@dont-email.me> <vhgfo7$1f8j9$1@dont-email.me> <vhiak4$1sjsn$2@dont-email.me> <vhif57$1u588$1@dont-email.me> <vhkj7j$25fe$2@dont-email.me> <87babad37e3024a0fb219567f6fb2b7c46ff5eb7@i2pn2.org> <vhlaj1$7jan$2@dont-email.me> MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit Injection-Date: Thu, 21 Nov 2024 00:08:24 -0000 (UTC) Injection-Info: i2pn2.org; logging-data="3418900"; mail-complaints-to="usenet@i2pn2.org"; posting-account="nS1KMHaUuWOnF/ukOJzx6Ssd8y16q9UPs1GZ+I3D0CM"; User-Agent: Pan/0.145 (Duplicitous mercenary valetism; d7e168a git.gnome.org/pan2) X-Spam-Checker-Version: SpamAssassin 4.0.0 Bytes: 3421 Lines: 41 Am Wed, 20 Nov 2024 19:42:41 +0100 schrieb WM: > On 20.11.2024 19:18, joes wrote: >> Am Wed, 20 Nov 2024 13:04:04 +0100 schrieb WM: > >>> Try to count to a natural number that has fewer successors than >>> predecessors. Impossible. >> Because there are no such numbers. > All successors are natural numbers. So? > If all can be counted, then no successors remain. All at once or every single one? There are no successors "after" all of the other numbers. >>> But set theory claims that all natural numbers can be counted to such >>> that no successors remain. >> et your quantifiers in order: > That is a foolish excuse. You have shown that you don't understand them. >> every single natural number is very clearly finite; > Every number that can be counted to is finite. There are countably infinite numbers, but ok. > But every number that can > be counted to has more successors than predecessors. Every number, period. There is no number without successors. > Therefore not every number can be counted to. Well, the ordinal numbers less than epsilon_0 are called countably infinite. >> the cardinal number corresponding to the set of all of them is >> countably infinite. > The set of all numbers that can be counted to is finite, namely a > number that is counted to. This cannot change by counting. WTF there is no largest number. How do you think counting changes anything? -- Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math: It is not guaranteed that n+1 exists for every n.