Path: ...!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!eternal-september.org!.POSTED!not-for-mail From: WM Newsgroups: sci.math Subject: Re: The set of necessary FISONs Date: Thu, 6 Feb 2025 20:32:53 +0100 Organization: A noiseless patient Spider Lines: 59 Message-ID: References: <680d4249c9bf1504231a53732ac5096184261495@i2pn2.org> <12a38458-bfb9-4611-9072-eadbb166c0ec@att.net> <908c8431-3d44-496c-8f5c-e33cc9554956@att.net> <1ab7ff67-f1fb-4814-9d28-c883a4756097@att.net> <451804be-c49f-43ab-bca9-8a4af406d945@att.net> <11e634bd-c1d3-4d72-9e18-be6ca22b4742@att.net> MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8; format=flowed Content-Transfer-Encoding: 8bit Injection-Date: Thu, 06 Feb 2025 20:32:54 +0100 (CET) Injection-Info: dont-email.me; posting-host="d6ed76419b2c6cfc2864f660aebeda9e"; logging-data="3253362"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX19IPx/e4Zgn3IN0xP5hYmMaOcq+tJLXyNs=" User-Agent: Mozilla Thunderbird Cancel-Lock: sha1:55UEZCqRp2BA04lZo3ctIAmX4Cs= Content-Language: en-US In-Reply-To: Bytes: 3658 On 06.02.2025 19:54, Jim Burns wrote: > On 2/6/2025 11:55 AM, WM wrote: >> On 06.02.2025 15:57, Jim Burns wrote: > >>> The key is that  ∀ᴺ¹n: ∃ᴺ¹j′: n> >> The key is that >> the set ℕ is created by induction. > > The set ℕ₁ is described as having induction valid for it. Then it is the collection ℕ_def of definable numbers. > > Sets missing natural numbers and > sets with extra, non.inducible, un.natural numbers > are not ℕ₁ Then it is the set ℕ of all natural numbers. You contradict yourself. > >> If the set M is described as the smallest set satisfying >> 1 ∈ M and n ∈ M ==> n+1 ∈ M >> then ℕ\M = Ø. > > ℕ₁ = ∅ satisfies that definition. No. 1 is not in ∅, > > Better: > ℕ₁ is the emptiest set M such that > 1 ∈ M and n ∈ M ⇒ n+1 ∈ M > Thus: > 1 ∈ ℕ₁ and n ∈ ℕ₁ ⇒ n+1 ∈ ℕ₁ > ∀P:(1 ∈ P and n ∈ P ⇒ n+1 ∈ P) ⇒ ℕ₁ ⊆ P > > Is ℕ₁ the emptiest set M such that > 1 ∈ M and n ∈ M ⇒ n+1 ∈ M ? Relevant is the set of FISONs. >> I prefer Wikipedia: >> ∀P( P(1) /\ ∀k(P(k) ==> P(k+1)) ==> ∀n (P(n)). > > That's intended to be part of the definition of ℕ₁ As well it is the definition of the collection of all FISONs. > > Which is curious, when one considers that > ℕ₁ appears nowhere in it. The axiom of induction holds for all predicates P which satisfy induction. If the set M is described as the smallest set satisfying F(1) ∈ M and F(n) ∈ M ==> F(n+1) ∈ M then M contains all FISONs which can be subtracted from U(Fn)) without changing the assumed result ℕ. Regards, WM