Deutsch   English   Français   Italiano  
<b656288bb1d5bed80574cd066a1a7f06258e70bc@i2pn2.org>

View for Bookmarking (what is this?)
Look up another Usenet article

Path: news.eternal-september.org!eternal-september.org!news.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: Sat, 7 Dec 2024 16:21:32 -0000 (UTC)
Organization: i2pn2 (i2pn.org)
Message-ID: <b656288bb1d5bed80574cd066a1a7f06258e70bc@i2pn2.org>
References: <vg7cp8$9jka$1@dont-email.me> <viaj9q$l91n$1@dont-email.me>
	<vibvfo$10t7o$1@dont-email.me> <vic6m9$11mrq$4@dont-email.me>
	<vicbp2$1316h$1@dont-email.me> <vid4ts$1777k$2@dont-email.me>
	<vidcv3$18pdu$1@dont-email.me> <bdbc0e3d-1db2-4d6a-9f71-368d36d96b40@tha.de>
	<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>
	<9627c2aea5e3ebabd917ab0b9d1c7b241821d893@i2pn2.org>
	<vit62l$1rfas$1@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit
Injection-Date: Sat, 7 Dec 2024 16:21:32 -0000 (UTC)
Injection-Info: i2pn2.org;
	logging-data="1680687"; 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

Am Thu, 05 Dec 2024 22:31:01 +0100 schrieb WM:
> On 05.12.2024 21:11, joes wrote:
>> Am Thu, 05 Dec 2024 20:30:22 +0100 schrieb WM:
>>> On 05.12.2024 18:12, Jim Burns wrote:
>>>> On 12/5/2024 4:00 AM, WM wrote:
>>>>> On 04.12.2024 21:36, Jim Burns wrote:
>>>>>> On 12/4/2024 12:29 PM, WM wrote:
>>>>
>>>>>> No intersection of more.than.finitely.many end.segments of the
>>>>>> finite.cardinals holds a finite.cardinal,  or is non.empty.
>>>>> Small wonder.
>>>>> More than finitely many endsegments require infinitely many indices,
>>>>> i.e., all indices. No natnumbers are remaining in the contents.
>>>> ⎛ That's the intersection.
>>> And it is the empty endsegment.
>> There is no empty segment.
> If all natnumbers have been lost, then nothing remains. If there are
> infinitely many endsegments, then all contents has become indices.
Yes, and then we don't need any more "contents".

>>> The contents cannot disappear "in the limit". It has to be lost one by
>>> one if ∀k ∈ ℕ : E(k+1) = E(k) \ {k} is really true for all natnumbers.
>> Same thing. Every finite number is "lost" in some segment.
>> All segments are infinite.
> Two identical sequences have the same limit.
> As long as all endsegments are infinite so is their intersection.
As long as you intersect only finitely many segments.

>>>>> More than finitely many endsegments require infinitely many indices,
>>>>> i.e., all indices. No natnumbers are remaining in the contents.
>> I really don't understand this connection. First, this also makes every
>> segment infinite. The set of all indices is the infinite N.
> Yes. It is E(1) having all natnumbers as its content.
And there is no empty segment.

-- 
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.