Sujet : Re: The set of necessary FISONs
De : wolfgang.mueckenheim (at) *nospam* tha.de (WM)
Groupes : sci.mathDate : 05. Mar 2025, 10:47:20
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <vq96j8$2bkek$2@dont-email.me>
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 05.03.2025 10:24, joes wrote:
Am Tue, 04 Mar 2025 20:56:17 +0100 schrieb WM:
Every induction surpasses every finite number
but never all finite numbers. It is always a finite number.
No. That is why you use induction instead of directly proving the finite
number of sentences.
For the last time: Understand or shut up!
If UF = ℕ, then there is at least one subset of FISONs producing ℕ. Such a set has a first element which is not conpletely useless. All finite FISONs are completely useless. Other FISONs are not existing.
Regards, WM