Path: ...!news.misty.com!weretis.net!feeder9.news.weretis.net!i2pn.org!i2pn2.org!.POSTED!not-for-mail From: joes Newsgroups: sci.math Subject: Re: The set of necessary FISONs Date: Mon, 24 Feb 2025 18:09:01 -0000 (UTC) Organization: i2pn2 (i2pn.org) Message-ID: References: <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> <26691e26-a27e-4c03-bc3d-29aa9fd825bc@att.net> MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit Injection-Date: Mon, 24 Feb 2025 18:09:01 -0000 (UTC) Injection-Info: i2pn2.org; logging-data="1587734"; 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: 3497 Lines: 39 Am Mon, 24 Feb 2025 18:10:26 +0100 schrieb WM: > On 24.02.2025 17:36, Jim Burns wrote: >> On 2/24/2025 9:59 AM, WM wrote: >>> 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 wantcing to be correct. >>>>> Peano, Zermelo, or v. Neumann >>>> ...agree that {{F}} ≠ {F} >>> and also that 3 ≠ pi. >> > >>>> >>>> {{}} ≠ {} > It is wrong to apply this in the present framework. Yes, you are wrong trying to talk about N \ {N}. >>> These axioms can be applied to show that all FISONs can be removed. >> {1,2}\{1,{2}} = {2} > Only such nonsense available? That is your nonsense. Try and formalise your shit. >>> The set of finite ordinals after v. Neuman is undoubtedly such a set. >> The set of finite ordinals after v. Neumann is not a finite set. >> A claim for each of its elements is silent about the set. > You are wrong. The existence of the set is guaranteed by elements which > are defined by induction. Note that induction has been invented for > proofs concerning infinitely many element. That has no bearing. Properties don’t transfer from elements to their set. >> Claims about each natural number are silent about ℕ. > Claims about the existence of all natural numbers are claims about the > exitstence of ℕ. We are not disputing the existence. -- 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.