| Deutsch English Français Italiano |
|
<d724cb9827cb78a436160a2e8f0a12eddf2f3c1c@i2pn2.org> View for Bookmarking (what is this?) Look up another Usenet article |
Path: ...!fu-berlin.de!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: Tue, 26 Nov 2024 10:10:36 -0000 (UTC) Organization: i2pn2 (i2pn.org) Message-ID: <d724cb9827cb78a436160a2e8f0a12eddf2f3c1c@i2pn2.org> References: <vg7cp8$9jka$1@dont-email.me> <vhprpj$15kfd$2@dont-email.me> <74bdc0f14fd0f2c6bfd9ac511a37f66b41948ac4@i2pn2.org> <vhq5ov$1793m$2@dont-email.me> <b82423aaf8df2203171c1eb1afcb913925875795@i2pn2.org> <vhqrsu$1bb1f$2@dont-email.me> <vhqu9n$1bqev$1@dont-email.me> <vhs9v9$1krl6$3@dont-email.me> <vhshas$1n123$1@dont-email.me> <vhsi31$1n2ck$1@dont-email.me> <vhsi7e$1n4sl$1@dont-email.me> <vhsit2$1n52r$1@dont-email.me> <vht7o6$1qo7j$1@dont-email.me> <vhtb3o$1r2tr$1@dont-email.me> <0d6d06a888e15ed2042aca8ec7e6ebb93590b7bc@i2pn2.org> <vhtgec$1rdku$3@dont-email.me> <8a2aedd8383a84ceef2fd985ac0bf529e2a0eccf@i2pn2.org> <vhuv94$25ro0$1@dont-email.me> <be7b74a5d83b8ceebd1ec380bb57ff4190ec0cae@i2pn2.org> <vhv61v$25uqa$5@dont-email.me> <b75deca6b1a0631255cf1402ee83db2b266edd22@i2pn2.org> <vhvnvc$2aq7k$1@dont-email.me> <3fe6ef31f562e0ddf598de46cf864986ca909687@i2pn2.org> <vi1pul$2n5v3$1@dont-email.me> <9cb8aec671200bb6d71582fd607b876b7ec4c83a@i2pn2.org> <vi43br$3cllo$3@dont-email.me> MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit Injection-Date: Tue, 26 Nov 2024 10:10:36 -0000 (UTC) Injection-Info: i2pn2.org; logging-data="4192427"; 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: 4134 Lines: 52 Am Tue, 26 Nov 2024 10:11:22 +0100 schrieb WM: > On 25.11.2024 22:05, joes wrote: >> Am Mon, 25 Nov 2024 13:18:28 +0100 schrieb WM: > >>>> But there is no finite set with ALL natural numbers. >>>> Like usual, you mess up with your qualifiers. >>> ℕ is fixed, that means |ℕ| is fixed. >> What does that have to do with it? > It is impossible to add or to delete an element. > It is impossible to change |ℕ| by 1 or more. It is possible to change N to N\0. How does that relate to all infinitely many naturals being finite? >>>>>> Limit theory only works if the limit actually exists >>>>> If limits exist at all, then the limit of the sequence 1/10, 1/10, >>>>> 1/10, ... does exist. >>>> But the concept of 1/10th of an infinte set does not exist.. >>> It does. >> It has the same cardinality. > Yes, it is much. Countably infinite. >>>>>> You can get things that APPEAR to reach a limit, but actually >>>>>> don't. >>>>> But if infinite sets do exist, then the set ℕ does exist, and all >>>>> its elements are members of finite intervals (0, n]. >>>> No, any given element is a member of a finite set, but you can't then >>>> say that ALL are in such a set. >>> All are in the union of all finite sets. >> Why not just directly take N, made up of finite numbers? > Why not? Do it. Consider the black hats at every 10 n and white hats at > all other numbers n. It is possible to shift the black hats such that > every interval (0, n] is completely covered by black hats. There is no > first n discernible that cannot be covered by black hat. Cantor proved nothing more. > But the origin > of each used black hat larger than n is now covered by a white hat. Not if you really coloured ALL n. > Without deleting all white hats it is not possible to cover all n by > black hats. But deleting white hats is prohibited by logic. Exchanging > can never delete one of the exchanged elements. An infinite exchange can. > Therefore we have here, > like in all Cantor-pairings, the same impediment and further disussion > is futile. Thanks for shutting up. -- 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.