Deutsch English Français Italiano |
<ffc091060eadd83bf8d6391f08400762666b2e63@i2pn2.org> View for Bookmarking (what is this?) Look up another Usenet article |
Path: ...!eternal-september.org!feeder3.eternal-september.org!i2pn.org!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 (extra-ordinary) Date: Mon, 9 Dec 2024 19:54:55 -0000 (UTC) Organization: i2pn2 (i2pn.org) Message-ID: <ffc091060eadd83bf8d6391f08400762666b2e63@i2pn2.org> References: <vg7cp8$9jka$1@dont-email.me> <vier32$1madr$1@dont-email.me> <vierv5$1l1ot$2@dont-email.me> <viiqfd$2qq41$5@dont-email.me> <vik73d$3a9jm$1@dont-email.me> <vikg6c$3c4tu$1@dont-email.me> <9bcc128b-dea8-4397-9963-45c93d1c14c7@att.net> <vimvgd$3vv5r$9@dont-email.me> <50c82b03-8aa1-492c-9af3-4cf2673d6516@att.net> <vip5mo$p0da$1@dont-email.me> <vipb6l$qfig$1@dont-email.me> <viplj0$t1f8$1@dont-email.me> <5a122d22-2b21-4d65-9f5b-4f226eebf9d4@att.net> <viq3i2$105iq$1@dont-email.me> <e055ec41-a98d-4917-802f-169575a5b556@att.net> <virq3t$1gs07$1@dont-email.me> <c8faf784-348a-42e9-a784-b2337f4e8160@att.net> <3af23566-0dfc-4001-b19b-96e5d4110fee@tha.de> <ae606e53-0ded-4101-9685-fa33c9a35cb9@att.net> <viuc2a$27gm1$1@dont-email.me> <8a53c5d4-4afd-4f25-b1da-30d57e7fe91c@att.net> <vj1acu$31atn$3@dont-email.me> <ec451cd6-16ba-463d-8658-8588093e1696@att.net> <vj2f61$3b1no$1@dont-email.me> <10ebeeea-6712-4544-870b-92803ee1e398@att.net> <vj3tl0$3nktg$2@dont-email.me> MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit Injection-Date: Mon, 9 Dec 2024 19:54:55 -0000 (UTC) Injection-Info: i2pn2.org; logging-data="2023900"; 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: 3803 Lines: 47 Am Sun, 08 Dec 2024 11:50:08 +0100 schrieb WM: > On 08.12.2024 00:38, Jim Burns wrote: >> On 12/7/2024 4:37 PM, WM wrote: >>> On 07.12.2024 20:59, Jim Burns wrote: >>>> On 12/7/2024 6:09 AM, WM wrote: >>>>> On 06.12.2024 19:17, Jim Burns wrote: >>>>>> On 12/6/2024 3:19 AM, WM wrote: >>>>>>> On 05.12.2024 23:20, Jim Burns wrote: >> >>>>>>>> ⎜ With {} NOT as an end.segment, >>>>>>> all endsegments hold content. >>>>>> But no common.to.all finite.cardinals. >>>>> Show two endsegments which do not hold common content. >>>> I will, after you show me a more.than.finitely.many two. >>> There are no more than finitely many natural numbers which can be >>> shown. >>> All which can be shown have common content. > All endsegments which can be shown (by their indices) have common > content. Nope, not in common with all, only for finite intersections. >> Each end.segment is more.than.finite and the intersection of the >> end.segments is empty. > ∀n ∈ ℕ: E(1)∩E(2)∩...∩E(n) = E(n) > What can't I understand here? That all those n only produce finite intersections. >>> This is not gibberish but mathematics: >>> ∀n ∈ ℕ: E(1)∩E(2)∩...∩E(n) = E(n). >>> Every counter argument has to violate this. >> False. For example, see above. > >> Each finite.cardinal is not in common with more.than.finitely.many >> end.segments. > Of course not. All non-empty endsegments belong to a finite set with an > upper bound. There are definitely more than finitely many naturals and segments (none are empty). >> Each end.segment has, for each finite.cardinal, >> a subset larger than that cardinal. > That is not true for the last dark endsegments. It changes at the dark > finite cardinal ω/2. What changes to what? Why exactly there? -- 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.