Deutsch   English   Français   Italiano  
<8ef20494f573dc131234363177017bf9d6b647ee@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: joes <noreply@example.org>
Newsgroups: sci.math
Subject: Re: Incompleteness of Cantor's enumeration of the rational numbers
 (extra-ordinary)
Date: Fri, 3 Jan 2025 12:35:06 -0000 (UTC)
Organization: i2pn2 (i2pn.org)
Message-ID: <8ef20494f573dc131234363177017bf9d6b647ee@i2pn2.org>
References: <vg7cp8$9jka$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> <vkp0fv$b7ki$2@dont-email.me>
	<b125beff-cb76-4e5a-b8b8-e4c57ff468e9@att.net> <vkr8j0$t59a$1@dont-email.me>
	<98519289-0542-40ce-886e-b50b401ef8cf@att.net>
	<vksicn$16oaq$7@dont-email.me>
	<8e95dfce-05e7-4d31-b8f0-43bede36dc9b@att.net>
	<vl1ckt$2b4hr$1@dont-email.me>
	<53d93728-3442-4198-be92-5c9abe8a0a72@att.net>
	<vl5tds$39tut$1@dont-email.me>
	<9c18a839-9ab4-4778-84f2-481c77444254@att.net>
	<vl87n4$3qnct$1@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit
Injection-Date: Fri, 3 Jan 2025 12:35:06 -0000 (UTC)
Injection-Info: i2pn2.org;
	logging-data="1802568"; 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: 3148
Lines: 27

Am Fri, 03 Jan 2025 09:39:01 +0100 schrieb WM:
> On 02.01.2025 19:19, Jim Burns wrote:
>> On 1/2/2025 6:31 AM, WM wrote:
>>> On 31.12.2024 21:26, Jim Burns wrote:
>>>> On 12/31/2024 1:20 PM, WM wrote:
>> 
>>>>> Every union of FISONs which stay below a certain threshold stays
>>>>> below that threshold.
>>>>> Note: Every FISON stays below 1 % of ℕ.
>>>> For each finite ⟦0,j⦆, there are more.than.#⟦0,j⦆.many finite ⟦0,k⦆
>>> So it is for all definable natural numbers.
>> So it is for each finite.ordinal.
> That is impossible, because all finite ordinals can be subtracted from ℕ
> without infinitely many remaining. If you don't understand that, it is
> useless to go on.
>
>>> natural numbers which have only few successors because when they are
>>> removed nothing remains ℕ \ {1, 2, 3, ...} = { } .
>> ... the non.finite.ordinal natural.numbers.
>> We define natural.numbers to be only finite.ordinals, of which there
>> are more.than.any.finite.many.
> Infinitely many can be removed without remainder. But only finitely many
> can be defined by FISONs.
It is very obvious there are infinitely many FISONs.

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