Liste des Groupes | Revenir à s math |
On 26.02.2025 13:22, joes wrote:It does not prove |N \ U{F(n): n e U(F)}| = oo.Am Wed, 26 Feb 2025 13:04:10 +0100 schrieb WM:The power of induction proves ∀n ∈ U(F): |ℕ \ {1, 2, 3, ..., n}| = ℵoOn 26.02.2025 12:53, joes wrote:They have, by the power of induction. (Infinity itself has been definedAm Wed, 26 Feb 2025 12:40:13 +0100 schrieb WM:Defining is a human activity. Never an infinity will be defined.On 25.02.2025 16:31, joes wrote:>Nope. There are inf. many ("defined") FISONs.The set of FISONs does not change.It is the set of definaed natural numbers. It depends on the
systemlike the set of known prime numbers.
separately.)
Yes, please do that, and not the number Infinity ("all naturals"). TheInduction does not include infinity, although it does proveThen consider only the natural numbers which are subject to induction.
infinitely many formulas containing finite numbers, but not the one
formula saying "all". It is not that strong.
number of naturals is not itself a natural number. So by "removing
every natural" you are removing a non-natural number. Get this?
Indeed, that you keep referring to removing |N| elements insteadNo, why should it? But the set is proven to exist by induction.The *set* is not in the set.He ascertains the set.Right. Zermelo produces all finite elements, no infinite element. SoAnd the number of these elements is not finite and not an element.
do I. That is the set.
Les messages affichés proviennent d'usenet.