Sujet : Re: The set of necessary FISONs
De : noreply (at) *nospam* example.org (joes)
Groupes : sci.mathDate : 09. Feb 2025, 13:34:36
Autres entêtes
Organisation : i2pn2 (i2pn.org)
Message-ID : <17c3fd7c534e3c33fc94f4deaaa60f9ba5465897@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 : Pan/0.145 (Duplicitous mercenary valetism; d7e168a git.gnome.org/pan2)
Am Sat, 08 Feb 2025 22:54:46 +0100 schrieb WM:
On 08.02.2025 18:43, Jim Burns wrote:
Do you use ω-1 ?
Not in this proof.:
The axiom of induction says: If any property or predicate P satifies
(P(1) /\ ∀k(P(k) ==> P(k+1)), then it describes all elements of an
inductive = infinite set. That is satisfied by the set M of all FISONs
which are useless in U(A(n)) = ℕ.
Caveat: P is *not* satisfied by the set of all k, only by its elements.
-- 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.