Path: news.eternal-september.org!eternal-september.org!.POSTED!not-for-mail From: WM Newsgroups: sci.math Subject: Re: The set of necessary FISONs Date: Mon, 24 Feb 2025 15:59:18 +0100 Organization: A noiseless patient Spider Lines: 57 Message-ID: References: <559d228c01ea290aec13e735ec85036862578165@i2pn2.org> <5220af0cb7d579f20d58809659d8dcb8d7ba046c@i2pn2.org> <685c1274-e22f-409d-b39c-c3a5430c2f57@att.net> <69f56ce0-08a2-4614-b102-e333175c643d@att.net> <9a88665f-211f-4260-b585-97c72c7b6d1b@att.net> <8bed122d8b355eff96158e6f5cb76cffcc42925c@i2pn2.org> <7a26856916099747e76314a2b4c79693e14426fd@i2pn2.org> <98baf83e-820e-4e1b-be2c-e5ea4802683d@att.net> <0876c2b9-2144-44c1-a26b-20176f5e2127@att.net> <067f772a-4f4c-4c27-8042-3f605f814876@att.net> MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8; format=flowed Content-Transfer-Encoding: 8bit Injection-Date: Mon, 24 Feb 2025 15:59:19 +0100 (CET) Injection-Info: dont-email.me; posting-host="54a1246fefc0cd6df478f6e4ca4c12e9"; logging-data="1199098"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX180IyUowJCkRls2IyaqmS7i1i1GFaZJYx4=" User-Agent: Mozilla Thunderbird Cancel-Lock: sha1:gMKp4iDrdXNhA11S8LzZMC00bJ0= Content-Language: en-US In-Reply-To: <067f772a-4f4c-4c27-8042-3f605f814876@att.net> On 23.02.2025 23:03, Jim Burns wrote: > On 2/23/2025 2:32 PM, WM wrote: >> On 23.02.2025 19:34, Jim Burns wrote: >>> On 2/23/2025 9:43 AM, WM wrote: > >>>> There is no reason to consider {{F}} at all. >>> >>> There is reason, but >>> only for people wanting to be correct. >> >> Peano, Zermelo, or v. Neumann > > ...agree that {{F}} ≠ {F} and also that 3 ≠ pi. > >> Peano, Zermelo, or v. Neumann create ℕ > > Peano, Zermelo, and v. Neumann assert axioms > from which the existence of ℕ follows > in a finite.sequence of not.first.false claims. These axioms can be applied to show that all FISONs can be removed. > >> as well as the set F of all FISONs >> by induction over the members >> for use in set theory >> without being what you erroneously call correct. > > A proof.by.induction shows that > some set, > such as the set {x:A(x)} of x such that A(x), > is inductive. > > The conclusion of a proof.by.induction > is that {x:A(x)} is the whole set. > > However, > not just any "whole set" is reliable here. > It must be a whole set such that > knowing {x:A(x)} is inductive > narrows > which set {x:A(x)} can be > to one set: that whole set. The set of finite ordinals after v. Neuman is undoubtedly such a set. >>>> We omit all F(n) which amounts to remove F. >>>> Like all natural numbers amount to ℕ (not {ℕ}) > > Each natural number is in the domain of ST+F > ℕ is not in the domain of ST+F Only all FISONs = natural numbers are the matter of my proof. According to Zermelo they make up the set ℕ. Regards, WM