Sujet : Re: The set of necessary FISONs
De : noreply (at) *nospam* example.org (joes)
Groupes : sci.mathDate : 15. Feb 2025, 18:54:05
Autres entêtes
Organisation : i2pn2 (i2pn.org)
Message-ID : <340761ab1ceb68741d949331a0c64a3d6d5fa237@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, 15 Feb 2025 12:50:40 +0100 schrieb WM:
On 14.02.2025 19:02, Richard Damon wrote:
On 2/14/25 11:28 AM, WM wrote:
The definition is that it is a set of FISONs which has a smallest
element that is not as useless as a cup of coffee.
Which, as I said, is a definition in Naive Set theory,
Obviously you have no clue of set theory, be it naive or advanced. Every
set of ordinals has a smallest element. Look up the notion of
well-order.
No, that is not the definition. No element of the set of FISONs is
necessary (though one could be, if we wouldn’t agree that none is)
for their union to be N. *That* set has a smallest element, as does
every other infinite set of FISONs (the nonempty finite sets do as
well, but their union is not N, but the largest FISON). Now you
come along and claim that the empty set should have a first element.
-- 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.