Re: The set of necessary FISONs

On 27.01.2025 13:14, FromTheRafters wrote:

WM has brought this to us :

On 26.01.2025 20:29, FromTheRafters wrote:
>

Sure, but the 'S' in FISON stands for segment, not set, and ordinals have order and are constructed non-arbitrarily.

>
A segment written as a set has no order.

 Then it is not a FISON.

Nevertheless it has the same set of elements. Only that is relevant for my argument.

 Google's AI says: (and everyone's gonna love this one)
 =====================================================
AI Overview
 FISONs are a sequence of numbers that prove dark natural numbers. Each FISON ends with a natural number, and every finite union of FISONs is also a FISON.
 Explanation
     FISONs: A sequence of numbers that prove dark natural numbers.
    Dark natural numbers: Proved by the sequence of FISONs.
    Natural number: A number that ends a FISON.
    Finite union: A union of FISONs that is also a FISON.
 Example
     The sequence of FISONs can be represented as {1}, {1, 2}, {1, 2, 3}, and so on.
    Each FISON ends with a natural number, such as 1, 2, or 3.
    Every finite union of FISONs is also a FISON, such as {1} » {1, 2} = {1, 2}.
     Dark numbers
    Dark natural numbers proved by the sequence of FISONs ... actual infinity exchanges quantifiers and states $ع "Fn: |Fn| < |ع| ⁄ Fn...
    Technische Hochschule Augsburg

The latter is not readable.
Regards, WM