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 set of necessary FISONs
Date: Mon, 27 Jan 2025 14:14:33 -0000 (UTC)
Organization: i2pn2 (i2pn.org)
Message-ID: <814297ada299a65bb9f427ddec5646afcc94be9f@i2pn2.org>
References: <vmo1bs$1rnl$1@dont-email.me>
	<ee4e189d-56bc-4ed7-b7b7-cd71fc4d2349@att.net> <vmqh9k$urua$1@dont-email.me>
	<903de8e1-3538-4cfe-9f7a-6509eda47ab6@att.net>
	<vmsvfv$1hn5k$1@dont-email.me>
	<3844edd7-0750-4418-bff6-2759817446b3@att.net>
	<vmvn1h$25r19$1@dont-email.me>
	<27377646-137a-4f8f-a7bb-a75707b2da96@att.net>
	<vn2gcf$2ouuo$2@dont-email.me>
	<965ee9868f28953d437113d0d38f069815499a3f@i2pn2.org>
	<vn4sfi$3ijdb$2@dont-email.me>
	<e51fcde5622ccc6beab7882831e5f7033c04d150@i2pn2.org>
	<vn5gur$3qu1c$3@dont-email.me>
	<77fb6230f3ef78f7524b70785c4772313e238258@i2pn2.org>
	<vn7r2r$q7sl$2@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit
Injection-Date: Mon, 27 Jan 2025 14:14:33 -0000 (UTC)
Injection-Info: i2pn2.org;
	logging-data="1353018"; 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: 1988
Lines: 12

Am Mon, 27 Jan 2025 12:35:56 +0100 schrieb WM:
> On 26.01.2025 23:31, Richard Damon wrote:

>> you can't show that the first FISON isn't a member of the set of
>> necessary FISONs without assuming the set of necessary FISONs exists.
> 
> Logic? The set ℕ exists. And I can show that every FISON is neither
> necessary nor sufficient to accomplish that aim.
Obviously, but not for infinite sets of 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.