Sujet : Re: The set of necessary FISONs
De : richard (at) *nospam* damon-family.org (Richard Damon)
Groupes : sci.mathDate : 06. Feb 2025, 03:29:38
Autres entêtes
Organisation : i2pn2 (i2pn.org)
Message-ID : <b46a22eb014d24357179f7dc1d5e15fc2da2a102@i2pn2.org>
References : 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25
User-Agent : Mozilla Thunderbird
On 2/5/25 2:18 PM, WM wrote:
On 05.02.2025 19:43, Jim Burns wrote:
It might just matter what a natural number, induction,
a FISON, and a union are.
The axiom of induction:∀P( P(1) /\ ∀k(P(k) ==> P(k+1)) ==> ∀n (P(n)))
P(1): U(F(n) \ F(1)) = ℕ.
P(k): U(F(n) \ {F(1), F(2), ..., F(k)}) = ℕ
==>
P(k+1): U(F(n) \ {F(1), F(2), ..., F(k+1)}) = ℕ.
Regards, WM
And thus you can claim that no F(n) is "necessary".
Doesn't mean you can't use a set of them to build the set of Natural Numbers.
Unless you want to admit that you logic says we can't factor 36, since none of its factors are "necessary" in such a factoring.