Deutsch   English   Français   Italiano  
<29f6320a8227ebe9fde8ef77fb8068e1595c7ec9@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: Richard Damon <richard@damon-family.org>
Newsgroups: sci.math
Subject: Re: Incompleteness of Cantor's enumeration of the rational numbers
 (extra-ordinary, effectively)
Date: Tue, 7 Jan 2025 07:35:48 -0500
Organization: i2pn2 (i2pn.org)
Message-ID: <29f6320a8227ebe9fde8ef77fb8068e1595c7ec9@i2pn2.org>
References: <vg7cp8$9jka$1@dont-email.me> <vktmi3$1ia1u$1@dont-email.me>
 <c46775b30460bc564b3fe7bd1b838713829024f8@i2pn2.org>
 <vkv3t1$1qb93$1@dont-email.me>
 <2163aa0c0efba66c813e8ebda5ef5ece6d19ea34@i2pn2.org>
 <vl1bp4$2bcos$2@dont-email.me>
 <4d797c9134ea480aa4976cf866cacaede8d309bd@i2pn2.org>
 <vl5uid$3au1p$1@dont-email.me> <vl650i$3c2ia$1@dont-email.me>
 <vl6il4$3ecap$5@dont-email.me>
 <1e8ebc58a12fd659e38d0b9f0ff6fc0194f933be@i2pn2.org>
 <vl88v4$3qtjc$5@dont-email.me>
 <ecf6965f78c9152b3fff0d3b18d7df0247100acf@i2pn2.org>
 <vl9605$3vk27$5@dont-email.me>
 <9a25e92033e0a4d24e9c27df0de95d8b033d0862@i2pn2.org>
 <vlasro$cr0k$1@dont-email.me>
 <a676a0802d5bdf15dd22a1f8cd5072893b6e1e33@i2pn2.org>
 <vldn14$vlah$2@dont-email.me>
 <171d790a8a99fa28e5b849e2726d1c9c0f93d932@i2pn2.org>
 <vlefcq$14esf$7@dont-email.me>
 <51593821cf96cef1e5f8c4d1cf692dc145064429@i2pn2.org>
 <vlenld$1686e$1@dont-email.me>
 <a7f1132ebfd75ea109677673504c18cb810f5406@i2pn2.org>
 <vlh5it$1nnkl$2@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Tue, 7 Jan 2025 12:35:48 -0000 (UTC)
Injection-Info: i2pn2.org;
	logging-data="2445394"; mail-complaints-to="usenet@i2pn2.org";
	posting-account="diqKR1lalukngNWEqoq9/uFtbkm5U+w3w6FQ0yesrXg";
User-Agent: Mozilla Thunderbird
Content-Language: en-US
X-Spam-Checker-Version: SpamAssassin 4.0.0
In-Reply-To: <vlh5it$1nnkl$2@dont-email.me>
Bytes: 3697
Lines: 48

On 1/6/25 12:57 PM, WM wrote:
> On 06.01.2025 13:28, Richard Damon wrote:
>> On 1/5/25 2:47 PM, WM wrote:
> 
>>> You said that I never used all FISONs. But I do. All are insufficient.
>>
>> No, you DON'T use all. Because ALL has an infinite number of members,
> 
> All are less than |ℕ|/10000.

Which is |ℕ|, which just means each is individually finite.

But the INFINITE set of them makes an INFINITE set.

> 
>> and you need to process them one by one,
> 
> I do not process them but use my theorem: Every union of FISONs which 
> stay below a certain threshold stays below that threshold.

You mean you use your LIE. You don't even know what a theorem is, and 
can't because you call the real concept of a theorem a "mathology". So, 
either you admit you are just lying about it being a "theorem" or you 
admit that your rejection of "Mathology" is just a lie.

Your problem is you talk out of both sides of your mouth, and one of 
those sides is your rear end. Your words are just lies because you don't 
understand their meanings.

>>>> but your claim doesn't match your conclusion, as the union of *ALL* 
>>>> the FISIONs will reach the size of the Natural Numbers, even though 
>>>> no finite subset reaches a measurable percentage of it.
>>>>
>>> How do they do it? Do one or more FISONs grow during the union 
>>> process? (One would be sufficient.)
>>
>> Nope, they are just infinite in number.
> 
> The set of all rationals between 0 and 1 is also infinite in number. 
> That is not an argument for their union to reach |ℕ|.
> 

No, and using strawmen like that just shows you don't have any grounds 
for your claim.

Sorry, you are just proving your utter stupidity.

> Regards, WM