Liste des Groupes | Revenir à s math |
On 14.02.2025 16:42, Jim Burns wrote:A proof based on broken logic, so not actually a proof.On 2/14/2025 7:52 AM, WM wrote:Where all elements are covered by induction.Induction creates infinite sets.>
Zermelo set theory [I...VII] describes
a domain of discourse with
Z an inductiveᶻ setAnd no element is outside.If i contruct x(1) and from x(n) follows x(n+1)>
then the set of all x(n) is infinite.
then the set of all x(n) is
an inductive subset of the minimal.inductive set.There is no set of all FISON.numbers in ST+F.But it is the result of the proof. There is not the least doubt that no FISON remains for constructing ℕ.
Regards, WM
Les messages affichés proviennent d'usenet.