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

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

Path: ...!weretis.net!feeder9.news.weretis.net!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: Mon, 30 Dec 2024 11:11:07 -0500
Organization: i2pn2 (i2pn.org)
Message-ID: <89210011f33ddf8367c67ead44eb8bda225cfda5@i2pn2.org>
References: <vg7cp8$9jka$1@dont-email.me> <vjv6uv$2dra0$1@dont-email.me>
 <31180d7e-1c2b-4e2b-b8d6-e3e62f05da43@att.net> <vk1brk$2srss$7@dont-email.me>
 <bb80c6c5-04c0-4e2d-bb21-ac51aab9e252@att.net> <vk23m7$31l8v$1@dont-email.me>
 <bce1b27d-170c-4385-8938-36805c983c49@att.net> <vk693m$f52$2@dont-email.me>
 <a17eb8b6-7d11-4c59-b98c-b4d5de8358ca@att.net> <vk7dmb$7mh2$2@dont-email.me>
 <b72490c1-e61a-4c23-a3a5-f624b2c084e4@att.net> <vk8tbq$j9h1$1@dont-email.me>
 <bd7dfdc7-6471-4fe6-b078-0ca739031580@att.net> <vklumc$3htmt$1@dont-email.me>
 <c03cf79d-0572-4b19-ad92-a0d12df53db9@att.net>
 <n9CdnR02SsevtPL6nZ2dnZfqnPidnZ2d@giganews.com>
 <45a632ed-26cc-4730-a8dd-1e504d6df549@att.net> <vkpa98$dofu$2@dont-email.me>
 <15f183ae29abb8c09c0915ee3c8355634636da31@i2pn2.org>
 <vkra77$tpqs$1@dont-email.me>
 <c952199b5513be28bb1f5c8b374a2d7a77470743@i2pn2.org>
 <vks2ae$13p6j$1@dont-email.me>
 <104bb752404701738187104c93bbfe5f8e62bacb@i2pn2.org>
 <vktmsj$1hmvv$1@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Mon, 30 Dec 2024 16:11:07 -0000 (UTC)
Injection-Info: i2pn2.org;
	logging-data="1195895"; mail-complaints-to="usenet@i2pn2.org";
	posting-account="diqKR1lalukngNWEqoq9/uFtbkm5U+w3w6FQ0yesrXg";
User-Agent: Mozilla Thunderbird
In-Reply-To: <vktmsj$1hmvv$1@dont-email.me>
Content-Language: en-US
X-Spam-Checker-Version: SpamAssassin 4.0.0
Bytes: 3048
Lines: 31

On 12/30/24 3:50 AM, WM wrote:
> On 30.12.2024 01:39, Richard Damon wrote:
>> On 12/29/24 12:53 PM, WM wrote:
>>> On 29.12.2024 13:34, Richard Damon wrote:
>>>> On 12/29/24 6:01 AM, WM wrote:
>>>
>>>>>
>>>>> All definable numbers (FISONs) stay below 1 %. Every union of 
>>>>> "below 1 %" stays below 1 %.
>>>>
>>>> Since 0 is Less than 1, you are sort of correct, but that fact 
>>>> doesn't prove your claim.
>>>>
>>>> The problem is that when you get to *ALL* 
>>>
>>> I get to all FISONs below a certain threshold, namely a threshold 
>>> between which and ω there exist ℵ₀ natnumbers.
>>>
>> Which isn't "All FISONs"
> 
> Do you personally know FISONs larger than those? Please let me know them.
> 
> Regards, WM
> 

Sure, if your threshold is n, then the fision from 1 to n+1 is bigger 
than that. and from there you can get to n+2, then n+3, and can start to 
understand what happens as you get to infinity.

Of course, to do that, you need to abandon the concept that you are only 
working with SOME of the set, and not ALL of it, and thus there isn't a 
"last" element, as the set is infinite.