Path: ...!weretis.net!feeder9.news.weretis.net!news.nk.ca!rocksolid2!i2pn2.org!.POSTED!not-for-mail
From: joes <noreply@example.org>
Newsgroups: sci.math
Subject: Re: The reality of sets, on a scale of 1 to 10 [Was: The
 non-existence of "dark numbers"]
Date: Tue, 25 Mar 2025 22:20:56 -0000 (UTC)
Organization: i2pn2 (i2pn.org)
Message-ID: <deeea4f7da396b2eb10f7ecd30befa31c9fa978c@i2pn2.org>
References: <vqrbtd$1chb7$2@solani.org>
	<0b8644b2-7027-420e-b187-8214daaf9e3b@att.net>
	<vrf5bp$1gcun$1@dont-email.me>
	<b3730bf7-bcd1-4698-b465-6d6ef190b29d@att.net>
	<vrgm1k$2s8c6$2@dont-email.me>
	<c81100d7-9354-4c8e-b216-e147cab9b41c@att.net>
	<vrhrlb$3ta8t$1@dont-email.me>
	<c0de7504-7d17-42f1-83e8-8767c0859c0c@att.net>
	<vrj5nh$12273$1@dont-email.me>
	<efbe60c5-6691-4fd6-8638-589fd95ec8a4@att.net>
	<vrkabi$233at$1@dont-email.me> <vrkca8$18dh$1@news.muc.de>
	<vrlt7r$3hfcp$3@dont-email.me> <vrmg0s$308h$1@news.muc.de>
	<vrpfon$2q4gq$1@dont-email.me>
	<03b5612b3dc44f246b57ec258971a16823e678f9@i2pn2.org>
	<vrsceo$1gv1d$5@dont-email.me>
	<1299efece1e9894141d38a848b0d53c3a051a467@i2pn2.org>
	<vruvdq$3vgl7$1@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit
Injection-Date: Tue, 25 Mar 2025 22:20:56 -0000 (UTC)
Injection-Info: i2pn2.org;
	logging-data="1744010"; 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: 2424
Lines: 22

Am Tue, 25 Mar 2025 20:16:10 +0100 schrieb WM:
> On 25.03.2025 09:18, joes wrote:
>> Am Mon, 24 Mar 2025 20:40:07 +0100 schrieb WM:
>>> On 24.03.2025 02:11, joes wrote:
>>>> Am Sun, 23 Mar 2025 18:18:15 +0100 schrieb WM:
>>>
>>>>> The "bijection" is invalid because there are always infinitely many
>>>>> elements following after every defined pair.
>>>> Which are also bijected.
>>> How can you prove that?
>> How can you disprove it?
> Knowing that every pair belongs to a finite initial segment.
Of course it does.

> Upon it
> follow infinitely many elements which cannot be proven to have partners
> in the other set.
Neither can they be disproven.


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