• Re: Set Theory is DEAD! PLO

    From olcott@21:1/5 to olcott on Tue Nov 21 18:47:28 2023
    On 11/21/2023 6:37 PM, olcott wrote:
    On 11/6/2023 5:00 AM, Adam Polak wrote:
    Dear Friends,

    The Set Theory, creator of which is considered to be Professor Georg
    Cantor, currently adhered to by the vast majority of scientists, is an
    undoubtedly flawed theory, based on erroneous assumptions and, as a
    result, filled with errors and internal contradictions.


    So I see you never got this memo: https://en.wikipedia.org/wiki/Zermelo%E2%80%93Fraenkel_set_theory

    *Cantor's set theory has been called naive set theory for a long time*


    *I am surprised that no one here seemed to know this and the above* https://en.wikipedia.org/wiki/Naive_set_theory

    --
    Copyright 2023 Olcott "Talent hits a target no one else can hit; Genius
    hits a target no one else can see." Arthur Schopenhauer

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Fritz Feldhase@21:1/5 to olcott on Tue Nov 21 17:02:01 2023
    On Wednesday, November 22, 2023 at 1:47:36 AM UTC+1, olcott wrote:

    *I am surprised that no one here seemed to know this and the above* https://en.wikipedia.org/wiki/Naive_set_theory

    That's because we don't know any set theory (naive and/or axiomatic).

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From olcott@21:1/5 to Fritz Feldhase on Tue Nov 21 19:50:53 2023
    On 11/21/2023 7:02 PM, Fritz Feldhase wrote:
    On Wednesday, November 22, 2023 at 1:47:36 AM UTC+1, olcott wrote:

    *I am surprised that no one here seemed to know this and the above*
    https://en.wikipedia.org/wiki/Naive_set_theory

    That's because we don't know any set theory (naive and/or axiomatic).


    *Weird*
    Set theory, branch of mathematics that deals with the properties of well-defined collections of objects... https://www.britannica.com/science/set-theory

    --
    Copyright 2023 Olcott "Talent hits a target no one else can hit; Genius
    hits a target no one else can see." Arthur Schopenhauer

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From FromTheRafters@21:1/5 to All on Wed Nov 22 06:48:04 2023
    olcott explained on 11/21/2023 :
    On 11/21/2023 6:37 PM, olcott wrote:
    On 11/6/2023 5:00 AM, Adam Polak wrote:
    Dear Friends,

    The Set Theory, creator of which is considered to be Professor Georg
    Cantor, currently adhered to by the vast majority of scientists, is an
    undoubtedly flawed theory, based on erroneous assumptions and, as a
    result, filled with errors and internal contradictions.


    So I see you never got this memo:
    https://en.wikipedia.org/wiki/Zermelo%E2%80%93Fraenkel_set_theory

    *Cantor's set theory has been called naive set theory for a long time*


    *I am surprised that no one here seemed to know this and the above* https://en.wikipedia.org/wiki/Naive_set_theory

    You assume too much with so little evidence. Maybe we seem not to know
    because we mostly tend to ignore the obvious trolls and cranks.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Timothy Golden@21:1/5 to olcott on Wed Nov 22 06:13:39 2023
    On Tuesday, November 21, 2023 at 7:47:36 PM UTC-5, olcott wrote:
    On 11/21/2023 6:37 PM, olcott wrote:
    On 11/6/2023 5:00 AM, Adam Polak wrote:
    Dear Friends,

    The Set Theory, creator of which is considered to be Professor Georg
    Cantor, currently adhered to by the vast majority of scientists, is an
    undoubtedly flawed theory, based on erroneous assumptions and, as a
    result, filled with errors and internal contradictions.


    So I see you never got this memo: https://en.wikipedia.org/wiki/Zermelo%E2%80%93Fraenkel_set_theory

    *Cantor's set theory has been called naive set theory for a long time*

    *I am surprised that no one here seemed to know this and the above* https://en.wikipedia.org/wiki/Naive_set_theory

    This one above is very nicely written.
    It even bothers to discuss Cartesian order, and that is a pet study of mine. That set theory came along so late: could it be that they simply did not have the ability to step upon the toes of the real value?
    To go against such 'established mathematics' would be a knell for their work. Yet to mildly pass by, as if compatible; did someone possibly leave a nice chunk of chocolate in the peanut butter?
    Better yet, cashew butter. Ooh, if I could afford the stuff.
    Getting nutty never felt so fun.
    All stuck on your gums as your saliva slowly dissolves the stuff.

    did anyone trouble over the operators embedded in the values?
    It seems they did not. It would be like taking mathematics and throwing your hands up in the air, holding the whole ancient pile, and in a steady gentle breeze much of it drifts off as chaffe, and what remains, exactly? Did you mean to mix your elements
    and your operators so early and claim elemental status of the whole bunch? Did we perhaps expose a structural error in such commitments? Could we have absorbed some exceptions into our puritanical system a bit too early?

    Did your language ever commit nouns to verbs, verbs to nouns, and noun verb nouns to nouns? Is our own language in this dual form compromised? Does every object have an action? Should every object have an action? Then possibly their work can be admitted,
    for the noun/verb disparity would be eliminated. Of course the structrural change lays waste to most of grammar. Perhaps our GI will be speaking like Indians to us?
    "Tree", the native utters in his own tung, as his hands rise into the air vertically, then waving outwards, then cutting back in some, and waiving outwards again. As he get to the top; the crown of the tree, something changes in his demeanor.


    As if getting divisive was going to be productive: the matter of the computation of the division operator is not trivial and dies in fact lead to the unending digits such as:
    1/7 = 0.142857142857...
    while in truth should we hop over to radix seven we will simply see:
    1/7 = 0.1
    and so the mixed radix puzzle is somewhat bearing the fruit of the seemingly magical repeating decimal. Does it go on for ever? Did Dedekind really answer that? I'll take my own short answer any day.


    --
    Copyright 2023 Olcott "Talent hits a target no one else can hit; Genius
    hits a target no one else can see." Arthur Schopenhauer

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From olcott@21:1/5 to FromTheRafters on Wed Nov 22 08:59:53 2023
    On 11/22/2023 5:48 AM, FromTheRafters wrote:
    olcott explained on 11/21/2023 :
    On 11/21/2023 6:37 PM, olcott wrote:
    On 11/6/2023 5:00 AM, Adam Polak wrote:
    Dear Friends,

    The Set Theory, creator of which is considered to be Professor Georg
    Cantor, currently adhered to by the vast majority of scientists, is
    an undoubtedly flawed theory, based on erroneous assumptions and, as
    a result, filled with errors and internal contradictions.


    So I see you never got this memo:
    https://en.wikipedia.org/wiki/Zermelo%E2%80%93Fraenkel_set_theory

    *Cantor's set theory has been called naive set theory for a long time*


    *I am surprised that no one here seemed to know this and the above*
    https://en.wikipedia.org/wiki/Naive_set_theory

    You assume too much with so little evidence. Maybe we seem not to know because we mostly tend to ignore the obvious trolls and cranks.

    No one bothered to tell the guy that his fantastic insights about
    Russell's Paradox have been known for a long time. So in other words
    the people here that might know these things are also mere Trolls.

    --
    Copyright 2023 Olcott "Talent hits a target no one else can hit; Genius
    hits a target no one else can see." Arthur Schopenhauer

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From olcott@21:1/5 to Adam Polak on Wed Nov 22 16:31:24 2023
    On 11/6/2023 5:00 AM, Adam Polak wrote:
    Dear Friends,

    The Set Theory, creator of which is considered to be Professor Georg Cantor, currently adhered to by the vast majority of scientists, is an undoubtedly flawed theory, based on erroneous assumptions and, as a result, filled with errors and internal
    contradictions.

    The wide "Analysis of mistakes in infinity study attempts" within set theory can be found here on YouTube:
    https://www.youtube.com/watch?v=s23Cz8A0BKs

    In the upcoming presentations, we will together take a colser look on numerous errors in set theory, we will identify Hilbert's Grand Hotel Paradox errors, easily solve the Continuum Hypothesis (allegedly undecidable),

    Russell's Paradox, the Paradox of the set of all sets,

    These two have been abolished by (axiomatic set theory) https://en.wikipedia.org/wiki/Zermelo%E2%80%93Fraenkel_set_theory
    a very long time ago.

    It took me years (after finding out about Russell's Paradox) to find
    out that they have already been solved.

    The key thing to know is that paradoxes prove that our current
    understanding of things is incorrect.

    Modern math has bypassed this key insight by coming up with
    the category of undecidability that at a very superficial
    level does seem to simply "{explain away} paradoxes.

    and we will confirm even more emphatically that the set theory can be seen only as erroneous and disproven.

    A small sample below. A comparison that decisively, in an unquestionable manner, refutes the Cantor's Diagonal Argument as evidence of the inequality of the infinite set of real numbers relative to the infinite set of natural numbers.

    A hotel with an infinite number of rooms.
    There is a guest in each room.
    As a result, you have two infinite sets:

    An infinite SET OF ROOMS containing elements with the following symbols: R1, R2, R3, ...

    An infinite SET OF GUEST containing elements with the following symbols: G1, G2, G3...

    A new guest appears: NG1
    The new guest is definitely not among the guests that are already in the hotel because he is different from them, his name is: ("NG" + its individual number ) , everyone present in the hotel is: ("G"+ individual number of each ).

    If you claim that you can accommodate a new guest in room 1 and move everyone currently present in the hotel to rooms n+1
    you can do exactly the same thing with a "new" real number supposedly created by diagonal method.

    You assign "new" real numb to 1, and you shift all the real numbers previously in the right column of the diagonal matrix down by one: the one that was assigned to 1 is now assigned to 2, the one assigned to 2 is now assigned to 3, etc.

    It is mutually contradictory to say that you can accommodate a new guest in Hilbert's hotel and at the same time to say that you cannot find a natural number as a pair for a "new" real number "created" by the diagonal method.

    The set theory is clearly contradictory in many places.

    Best Regards,
    Adam Polak

    --
    Copyright 2023 Olcott "Talent hits a target no one else can hit; Genius
    hits a target no one else can see." Arthur Schopenhauer

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Fritz Feldhase@21:1/5 to olcott on Wed Nov 22 15:18:47 2023
    On Wednesday, November 22, 2023 at 11:31:32 PM UTC+1, olcott wrote:

    Russell's Paradox, the Paradox of the set of all sets,
    These two have been abolished by (axiomatic set theory) https://en.wikipedia.org/wiki/Zermelo%E2%80%93Fraenkel_set_theory
    a very long time ago.

    Though there are axiomatic set theories which do allow for a set of all sets.

    This set does not necessarily lead to a set theoretic antinomy (though "the Russell set" does and always will do so).

    Of course, if V is the set of all sets then V e V. (Still no problem in an appropriate axiomatic set theory).

    In the context of ZF(C), of course, there's no such set.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From olcott@21:1/5 to Fritz Feldhase on Wed Nov 22 19:58:01 2023
    On 11/22/2023 5:18 PM, Fritz Feldhase wrote:
    On Wednesday, November 22, 2023 at 11:31:32 PM UTC+1, olcott wrote:

    Russell's Paradox, the Paradox of the set of all sets,
    These two have been abolished by (axiomatic set theory)
    https://en.wikipedia.org/wiki/Zermelo%E2%80%93Fraenkel_set_theory
    a very long time ago.

    Though there are axiomatic set theories which do allow for a set of all sets.

    This set does not necessarily lead to a set theoretic antinomy (though "the Russell set" does and always will do so).

    Of course, if V is the set of all sets then V e V. (Still no problem in an appropriate axiomatic set theory).

    In the context of ZF(C), of course, there's no such set.

    My key unique innovation to this is that a set that contains itself
    is isomorphic to a can of soup that contains itself such that this can
    of soup has no outside surface.

    So we simply must forbid a set from containing itself as incoherent.

    --
    Copyright 2023 Olcott "Talent hits a target no one else can hit; Genius
    hits a target no one else can see." Arthur Schopenhauer

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Adam Polak@21:1/5 to All on Wed Nov 22 21:42:25 2023
    czwartek, 23 listopada 2023 o 02:58:10 UTC+1 olcott napisał(a):
    On 11/22/2023 5:18 PM, Fritz Feldhase wrote:
    On Wednesday, November 22, 2023 at 11:31:32 PM UTC+1, olcott wrote:

    Russell's Paradox, the Paradox of the set of all sets,
    These two have been abolished by (axiomatic set theory)
    https://en.wikipedia.org/wiki/Zermelo%E2%80%93Fraenkel_set_theory
    a very long time ago.

    Though there are axiomatic set theories which do allow for a set of all sets.

    This set does not necessarily lead to a set theoretic antinomy (though "the Russell set" does and always will do so).

    Of course, if V is the set of all sets then V e V. (Still no problem in an appropriate axiomatic set theory).

    In the context of ZF(C), of course, there's no such set.
    My key unique innovation to this is that a set that contains itself
    is isomorphic to a can of soup that contains itself such that this can
    of soup has no outside surface.

    So we simply must forbid a set from containing itself as incoherent.
    --
    Copyright 2023 Olcott "Talent hits a target no one else can hit; Genius
    hits a target no one else can see." Arthur Schopenhauer

    So you want to forbid exactly this:
    { { } }
    As you write, it is: "incoherent".
    All right.
    Have a nice day.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Adam Polak@21:1/5 to All on Wed Nov 22 21:56:06 2023
    czwartek, 23 listopada 2023 o 02:58:10 UTC+1 olcott napisał(a):
    On 11/22/2023 5:18 PM, Fritz Feldhase wrote:
    On Wednesday, November 22, 2023 at 11:31:32 PM UTC+1, olcott wrote:

    Russell's Paradox, the Paradox of the set of all sets,
    These two have been abolished by (axiomatic set theory)
    https://en.wikipedia.org/wiki/Zermelo%E2%80%93Fraenkel_set_theory
    a very long time ago.

    Though there are axiomatic set theories which do allow for a set of all sets.

    This set does not necessarily lead to a set theoretic antinomy (though "the Russell set" does and always will do so).

    Of course, if V is the set of all sets then V e V. (Still no problem in an appropriate axiomatic set theory).

    In the context of ZF(C), of course, there's no such set.
    My key unique innovation to this is that a set that contains itself
    is isomorphic to a can of soup that contains itself such that this can
    of soup has no outside surface.

    So we simply must forbid a set from containing itself as incoherent.
    --
    Copyright 2023 Olcott "Talent hits a target no one else can hit; Genius
    hits a target no one else can see." Arthur Schopenhauer


    "So we simply must forbid a set from containing itself as incoherent."

    So you want to forbid exactly this:
    { { } }
    an empty set inserted as a single element into empty set
    As you write, it is: "incoherent".
    All right.
    I'm glad you're in favor of debunking set theory as "incoherent".
    I assure you, however, that you don't need to "forbid" anything - it's enough to show how absurd, naive and unfortunately just stupid set theory is, especially in the context of describing infinite sets.
    Have a nice day :)

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From olcott@21:1/5 to Adam Polak on Thu Nov 23 00:12:15 2023
    On 11/22/2023 11:56 PM, Adam Polak wrote:
    czwartek, 23 listopada 2023 o 02:58:10 UTC+1 olcott napisał(a):
    On 11/22/2023 5:18 PM, Fritz Feldhase wrote:
    On Wednesday, November 22, 2023 at 11:31:32 PM UTC+1, olcott wrote:

    Russell's Paradox, the Paradox of the set of all sets,
    These two have been abolished by (axiomatic set theory)
    https://en.wikipedia.org/wiki/Zermelo%E2%80%93Fraenkel_set_theory
    a very long time ago.

    Though there are axiomatic set theories which do allow for a set of all sets.

    This set does not necessarily lead to a set theoretic antinomy (though "the Russell set" does and always will do so).

    Of course, if V is the set of all sets then V e V. (Still no problem in an appropriate axiomatic set theory).

    In the context of ZF(C), of course, there's no such set.
    My key unique innovation to this is that a set that contains itself
    is isomorphic to a can of soup that contains itself such that this can
    of soup has no outside surface.

    So we simply must forbid a set from containing itself as incoherent.
    --
    Copyright 2023 Olcott "Talent hits a target no one else can hit; Genius
    hits a target no one else can see." Arthur Schopenhauer


    "So we simply must forbid a set from containing itself as incoherent."


    Did you know that ZFC already does forbid this?

    So you want to forbid exactly this:
    { { } }
    an empty set inserted as a single element into empty set
    As you write, it is: "incoherent".
    All right.
    I'm glad you're in favor of debunking set theory as "incoherent".
    I assure you, however, that you don't need to "forbid" anything - it's enough to show how absurd, naive and unfortunately just stupid set theory is, especially in the context of describing infinite sets.
    Have a nice day :)


    --
    Copyright 2023 Olcott "Talent hits a target no one else can hit; Genius
    hits a target no one else can see." Arthur Schopenhauer

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Adam Polak@21:1/5 to All on Wed Nov 22 23:07:33 2023
    czwartek, 23 listopada 2023 o 07:12:23 UTC+1 olcott napisał(a):
    On 11/22/2023 11:56 PM, Adam Polak wrote:
    czwartek, 23 listopada 2023 o 02:58:10 UTC+1 olcott napisał(a):
    On 11/22/2023 5:18 PM, Fritz Feldhase wrote:
    On Wednesday, November 22, 2023 at 11:31:32 PM UTC+1, olcott wrote: >>>
    Russell's Paradox, the Paradox of the set of all sets,
    These two have been abolished by (axiomatic set theory)
    https://en.wikipedia.org/wiki/Zermelo%E2%80%93Fraenkel_set_theory
    a very long time ago.

    Though there are axiomatic set theories which do allow for a set of all sets.

    This set does not necessarily lead to a set theoretic antinomy (though "the Russell set" does and always will do so).

    Of course, if V is the set of all sets then V e V. (Still no problem in an appropriate axiomatic set theory).

    In the context of ZF(C), of course, there's no such set.
    My key unique innovation to this is that a set that contains itself
    is isomorphic to a can of soup that contains itself such that this can
    of soup has no outside surface.

    So we simply must forbid a set from containing itself as incoherent.
    --
    Copyright 2023 Olcott "Talent hits a target no one else can hit; Genius >> hits a target no one else can see." Arthur Schopenhauer


    "So we simply must forbid a set from containing itself as incoherent."

    Did you know that ZFC already does forbid this?
    So you want to forbid exactly this:
    { { } }
    an empty set inserted as a single element into empty set
    As you write, it is: "incoherent".
    All right.
    I'm glad you're in favor of debunking set theory as "incoherent".
    I assure you, however, that you don't need to "forbid" anything - it's enough to show how absurd, naive and unfortunately just stupid set theory is, especially in the context of describing infinite sets.
    Have a nice day :)
    --
    Copyright 2023 Olcott "Talent hits a target no one else can hit; Genius
    hits a target no one else can see." Arthur Schopenhauer

    Your first statement:
    "So we simply must forbid a set from containing itself as incoherent."
    is contradictory to the second one:
    "Did you know that ZFC already does forbid this?"

    Don't you notice it? :
    ".. we .. must forbid a set from containing itself.. "
    ".. ZFC already does forbid this"

    ZFC, prohibits this: { { } }
    an empty set inserted as a single element into empty set
    ??
    thus "deleting" set theory
    Wow!

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Fritz Feldhase@21:1/5 to olcott on Thu Nov 23 00:49:20 2023
    On Thursday, November 23, 2023 at 2:58:10 AM UTC+1, olcott wrote:
    On 11/22/2023 5:18 PM, Fritz Feldhase wrote:
    On Wednesday, November 22, 2023 at 11:31:32 PM UTC+1, olcott wrote:

    Russell's Paradox, the Paradox of the set of all sets,
    These two have been abolished by (axiomatic set theory)
    https://en.wikipedia.org/wiki/Zermelo%E2%80%93Fraenkel_set_theory
    a very long time ago.

    Though there are axiomatic set theories which do allow for a set of all sets.

    This set does not necessarily lead to a set theoretic antinomy (though "the Russell set" does and always will do so).

    Of course, if V is the set of all sets then V e V. (Still no problem in an appropriate axiomatic set theory).

    In the context of ZF(C), of course, there's no such set.

    My key unique innovation to this is that a set that contains itself
    is isomorphic to a can of soup that contains itself such that this can
    of soup has no outside surface.

    So we simply must forbid a set from containing itself as incoherent.

    Such a set (a hyperset) is not allowed/possible in ZF(C). But there are variants of ZF(C) which do allow for such sets.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Fritz Feldhase@21:1/5 to Adam Polak on Thu Nov 23 00:57:41 2023
    On Thursday, November 23, 2023 at 6:56:12 AM UTC+1, Adam Polak wrote:

    "So we simply must forbid a set from containing itself as incoherent."

    So you want to forbid exactly this: { { } }

    Nope. He was talking about, say, a set A such that A e A holds. Especially, a set A where A = {A}.

    Note that A isn't empty (i.e. equal to { }) here, since A e A.

    In ZF(C) there are no such sets due to the axiom of foundation.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Fritz Feldhase@21:1/5 to Adam Polak on Thu Nov 23 01:05:48 2023
    On Thursday, November 23, 2023 at 8:07:39 AM UTC+1, Adam Polak wrote:

    "ZFC already does forbid this" (olcott)

    ZFC, prohibits this: { { } } ??

    No, it doesn't. But a set X such that X e X.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From FromTheRafters@21:1/5 to After serious thinking Adam Polak on Thu Nov 23 05:32:10 2023
    After serious thinking Adam Polak wrote :
    czwartek, 23 listopada 2023 o 02:58:10 UTC+1 olcott napisał(a):
    On 11/22/2023 5:18 PM, Fritz Feldhase wrote:
    On Wednesday, November 22, 2023 at 11:31:32 PM UTC+1, olcott wrote:

    Russell's Paradox, the Paradox of the set of all sets,
    These two have been abolished by (axiomatic set theory)
    https://en.wikipedia.org/wiki/Zermelo%E2%80%93Fraenkel_set_theory
    a very long time ago.

    Though there are axiomatic set theories which do allow for a set of all
    sets.

    This set does not necessarily lead to a set theoretic antinomy (though "the >>> Russell set" does and always will do so).

    Of course, if V is the set of all sets then V e V. (Still no problem in an >>> appropriate axiomatic set theory).

    In the context of ZF(C), of course, there's no such set.
    My key unique innovation to this is that a set that contains itself
    is isomorphic to a can of soup that contains itself such that this can
    of soup has no outside surface.

    So we simply must forbid a set from containing itself as incoherent.
    --
    Copyright 2023 Olcott "Talent hits a target no one else can hit; Genius
    hits a target no one else can see." Arthur Schopenhauer


    "So we simply must forbid a set from containing itself as incoherent."

    So you want to forbid exactly this:
    { { } }

    No, that is not a set containing itself.

    Under Frege, this {1,2,3} is.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Adam Polak@21:1/5 to All on Thu Nov 23 03:49:42 2023
    czwartek, 23 listopada 2023 o 11:32:25 UTC+1 FromTheRafters napisał(a):
    After serious thinking Adam Polak wrote :
    czwartek, 23 listopada 2023 o 02:58:10 UTC+1 olcott napisał(a):
    On 11/22/2023 5:18 PM, Fritz Feldhase wrote:
    On Wednesday, November 22, 2023 at 11:31:32 PM UTC+1, olcott wrote: >>>
    Russell's Paradox, the Paradox of the set of all sets,
    These two have been abolished by (axiomatic set theory)
    https://en.wikipedia.org/wiki/Zermelo%E2%80%93Fraenkel_set_theory
    a very long time ago.

    Though there are axiomatic set theories which do allow for a set of all >>> sets.

    This set does not necessarily lead to a set theoretic antinomy (though "the
    Russell set" does and always will do so).

    Of course, if V is the set of all sets then V e V. (Still no problem in an
    appropriate axiomatic set theory).

    In the context of ZF(C), of course, there's no such set.
    My key unique innovation to this is that a set that contains itself
    is isomorphic to a can of soup that contains itself such that this can
    of soup has no outside surface.

    So we simply must forbid a set from containing itself as incoherent.
    --
    Copyright 2023 Olcott "Talent hits a target no one else can hit; Genius >> hits a target no one else can see." Arthur Schopenhauer


    "So we simply must forbid a set from containing itself as incoherent."

    So you want to forbid exactly this:
    { { } }
    No, that is not a set containing itself.

    Under Frege, this {1,2,3} is.


    " { { } } <- No, that is not a set containing itself. "
    Is that what you think? :)

    let's start with one very simple question:
    how many elements does this set contain? : :
    { 1, 3, 4/4, 18 }

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Fritz Feldhase@21:1/5 to Adam Polak on Thu Nov 23 06:31:51 2023
    On Thursday, November 23, 2023 at 12:49:49 PM UTC+1, Adam Polak wrote:

    let's start with one very simple question:
    how many elements does this set contain? : :
    S = { 1, 3, 4/4, 18 }

    Actually, it's not t h a t simple. The answer depends...

    At least the following is certain: 1 <= card S <= 4

    If (say in the context of analysis) we consider 1 = 4/4, but 1 =/= 3, 1 =/= 18 and 3 =/= 18, then card S = 3.

    Hope this helps.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Fritz Feldhase@21:1/5 to Adam Polak on Thu Nov 23 06:41:25 2023
    On Thursday, November 23, 2023 at 12:49:49 PM UTC+1, Adam Polak wrote:

    { { } } is not a set containing itself.

    Indeed!

    Hint: The set { { } } contains an element (namely { }), while the set { } doesn't contain an element (since it is empty). Hence the sets { { } } and { } are not identical. Now { } is the only set in { { } }. Hence { { } } does not contain itself.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Timothy Golden@21:1/5 to FromTheRafters on Thu Nov 23 06:51:59 2023
    On Thursday, November 23, 2023 at 5:32:25 AM UTC-5, FromTheRafters wrote:
    After serious thinking Adam Polak wrote :
    czwartek, 23 listopada 2023 o 02:58:10 UTC+1 olcott napisał(a):
    On 11/22/2023 5:18 PM, Fritz Feldhase wrote:
    On Wednesday, November 22, 2023 at 11:31:32 PM UTC+1, olcott wrote: >>>
    Russell's Paradox, the Paradox of the set of all sets,
    These two have been abolished by (axiomatic set theory)
    https://en.wikipedia.org/wiki/Zermelo%E2%80%93Fraenkel_set_theory
    a very long time ago.

    Though there are axiomatic set theories which do allow for a set of all >>> sets.

    This set does not necessarily lead to a set theoretic antinomy (though "the
    Russell set" does and always will do so).

    Of course, if V is the set of all sets then V e V. (Still no problem in an
    appropriate axiomatic set theory).

    In the context of ZF(C), of course, there's no such set.
    My key unique innovation to this is that a set that contains itself
    is isomorphic to a can of soup that contains itself such that this can
    of soup has no outside surface.

    So we simply must forbid a set from containing itself as incoherent.
    --
    Copyright 2023 Olcott "Talent hits a target no one else can hit; Genius >> hits a target no one else can see." Arthur Schopenhauer


    "So we simply must forbid a set from containing itself as incoherent."

    So you want to forbid exactly this:
    { { } }
    No, that is not a set containing itself.

    Under Frege, this {1,2,3} is.

    Yeah, you could almost invert this and ask what a set that doesn't contain itself would be?
    By definition the set as a container is to have an identity, and if does not hold up then it would be a badly constructed set.
    The elements within the curly braces literally are the set; not the braces themselves. They are delimiters of notation. To worry over a technicality involving the curly braces, when we ordinarily happily discuss the set R without any curly braces: would
    this put all of real analysis at risk? We know that we cannot list all of R, and this does not stop us. We readily name a value 'a' in R, and so long as no constraints are placed upon this value to what degree is it R? You certainly are not going to
    prove that it is one singular value. Does naming the set {a,R} do anything? Can the variable take this treatment? Without the variable we would be badly handicapped, so to deny it doesn't seem very friendly. Yet mathematics needs the variable, and if
    anything could seem controversial to the subject it is the dancing value in an otherwise static landscape.

    That our computers do in fact have stringent requirements on such details, and the ability to distinguish between constant and variable; and that mathematicians so not care; no: this is not the case. The mathematicians do care and each one that learns C
    and type safety and compiler level integrity has made their way into actual computing hardware. That such a mathematician would care to fool themselves into believing that they can do more than their computer can by blowing off these restrictions is no
    longer a convincing position to hold. Computing languages abound. Processors are morphing. Keeping up seems next to impossible.

    The human logic breaks down well before much of this, as when we divide one integer by another and claim to come out upon a continuum. My computer tells me that 1/3=0, whereas modern humans believe it is 0.333... This is quite a simple conflict. Division
    is not fundamental. Mixing operators into values is not elemental. So my very usage of R above is suspect, but beyond that I suppose the problem could be simplified down to a singular digit. That would be quite clean. Is there any distinction in the set
    A={1,2,3,4,5,6,7,8,9,0}, and where a is in A, B={a,1,2,3,4,5,6,7,8,9,0}? Could I have simply said that B={a}? Is the issue of a multiplicity of values, versus the singular value, felt as blurred by the usage of a variable? I think it does affect the
    interpretation. To what degree as I issue some decree about the value three did I do so in A, in B, in the integers, in the Reals, et cetera, et cetera? Must the value three which I have mentioned in fact carry its set identity with it, then a sense of
    type imperative is felt. That we too readily mix these types, and claim various results at our own convenience is problematic. As to which is the elemental system: would such a basis be of interest?

    It seems as though the 'yes' answer will land us in discrete systems, and fortunately there is more to discuss there than just the natural number. It's almost as if the subject got pared down to fit the real value; almost as the funcers have stuck their
    stinky fingers into every orifice. When your numbers have been built on functions, and your addition operator, too, there isn't really much left to do but to bend over for the funcers. It is totally and provably unacceptable.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From olcott@21:1/5 to Fritz Feldhase on Thu Nov 23 09:47:11 2023
    On 11/23/2023 2:49 AM, Fritz Feldhase wrote:
    On Thursday, November 23, 2023 at 2:58:10 AM UTC+1, olcott wrote:
    On 11/22/2023 5:18 PM, Fritz Feldhase wrote:
    On Wednesday, November 22, 2023 at 11:31:32 PM UTC+1, olcott wrote:

    Russell's Paradox, the Paradox of the set of all sets,
    These two have been abolished by (axiomatic set theory)
    https://en.wikipedia.org/wiki/Zermelo%E2%80%93Fraenkel_set_theory
    a very long time ago.

    Though there are axiomatic set theories which do allow for a set of all sets.

    This set does not necessarily lead to a set theoretic antinomy (though "the Russell set" does and always will do so).

    Of course, if V is the set of all sets then V e V. (Still no problem in an appropriate axiomatic set theory).

    In the context of ZF(C), of course, there's no such set.

    My key unique innovation to this is that a set that contains itself
    is isomorphic to a can of soup that contains itself such that this can
    of soup has no outside surface.

    So we simply must forbid a set from containing itself as incoherent.

    Such a set (a hyperset) is not allowed/possible in ZF(C).

    Yes.

    But there are variants of ZF(C) which do allow for such sets.

    That sounds a little squirrely.

    --
    Copyright 2023 Olcott "Talent hits a target no one else can hit; Genius
    hits a target no one else can see." Arthur Schopenhauer

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From FromTheRafters@21:1/5 to All on Thu Nov 23 10:59:10 2023
    Adam Polak presented the following explanation :
    czwartek, 23 listopada 2023 o 11:32:25 UTC+1 FromTheRafters napisał(a):
    After serious thinking Adam Polak wrote :
    czwartek, 23 listopada 2023 o 02:58:10 UTC+1 olcott napisał(a):
    On 11/22/2023 5:18 PM, Fritz Feldhase wrote:
    On Wednesday, November 22, 2023 at 11:31:32 PM UTC+1, olcott wrote: >>>>>
    Russell's Paradox, the Paradox of the set of all sets,
    These two have been abolished by (axiomatic set theory)
    https://en.wikipedia.org/wiki/Zermelo%E2%80%93Fraenkel_set_theory
    a very long time ago.

    Though there are axiomatic set theories which do allow for a set of all >>>>> sets.

    This set does not necessarily lead to a set theoretic antinomy (though >>>>> "the Russell set" does and always will do so).

    Of course, if V is the set of all sets then V e V. (Still no problem in >>>>> an appropriate axiomatic set theory).

    In the context of ZF(C), of course, there's no such set.
    My key unique innovation to this is that a set that contains itself
    is isomorphic to a can of soup that contains itself such that this can >>>> of soup has no outside surface.

    So we simply must forbid a set from containing itself as incoherent.
    --
    Copyright 2023 Olcott "Talent hits a target no one else can hit; Genius >>>> hits a target no one else can see." Arthur Schopenhauer


    "So we simply must forbid a set from containing itself as incoherent."

    So you want to forbid exactly this:
    { { } }
    No, that is not a set containing itself.

    Under Frege, this {1,2,3} is.


    " { { } } <- No, that is not a set containing itself. "
    Is that what you think? :)

    I know this.

    let's start with one very simple question:
    how many elements does this set contain? : :
    { 1, 3, 4/4, 18 }

    Four symbols separated by three commas. I would say four elements.
    Cardinality four.

    How about this one?

    {{},elephant,gorrila,jackass}

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From olcott@21:1/5 to All on Thu Nov 23 10:09:27 2023
    T24gMTEvMjMvMjAyMyA4OjUxIEFNLCBUaW1vdGh5IEdvbGRlbiB3cm90ZToNCj4gT24gVGh1 cnNkYXksIE5vdmVtYmVyIDIzLCAyMDIzIGF0IDU6MzI6MjXigK9BTSBVVEMtNSwgRnJvbVRo ZVJhZnRlcnMgd3JvdGU6DQo+PiBBZnRlciBzZXJpb3VzIHRoaW5raW5nIEFkYW0gUG9sYWsg d3JvdGUgOg0KPj4+IGN6d2FydGVrLCAyMyBsaXN0b3BhZGEgMjAyMyBvIDAyOjU4OjEwIFVU QysxIG9sY290dCBuYXBpc2HFgihhKToNCj4+Pj4gT24gMTEvMjIvMjAyMyA1OjE4IFBNLCBG cml0eiBGZWxkaGFzZSB3cm90ZToNCj4+Pj4+IE9uIFdlZG5lc2RheSwgTm92ZW1iZXIgMjIs IDIwMjMgYXQgMTE6MzE6MzLigK9QTSBVVEMrMSwgb2xjb3R0IHdyb3RlOg0KPj4+Pj4NCj4+ Pj4+PiBSdXNzZWxsJ3MgUGFyYWRveCwgdGhlIFBhcmFkb3ggb2YgdGhlIHNldCBvZiBhbGwg c2V0cywNCj4+Pj4+PiBUaGVzZSB0d28gaGF2ZSBiZWVuIGFib2xpc2hlZCBieSAoYXhpb21h dGljIHNldCB0aGVvcnkpDQo+Pj4+Pj4gaHR0cHM6Ly9lbi53aWtpcGVkaWEub3JnL3dpa2kv WmVybWVsbyVFMiU4MCU5M0ZyYWVua2VsX3NldF90aGVvcnkNCj4+Pj4+PiBhIHZlcnkgbG9u ZyB0aW1lIGFnby4NCj4+Pj4+DQo+Pj4+PiBUaG91Z2ggdGhlcmUgYXJlIGF4aW9tYXRpYyBz ZXQgdGhlb3JpZXMgd2hpY2ggZG8gYWxsb3cgZm9yIGEgc2V0IG9mIGFsbA0KPj4+Pj4gc2V0 cy4NCj4+Pj4+DQo+Pj4+PiBUaGlzIHNldCBkb2VzIG5vdCBuZWNlc3NhcmlseSBsZWFkIHRv IGEgc2V0IHRoZW9yZXRpYyBhbnRpbm9teSAodGhvdWdoICJ0aGUNCj4+Pj4+IFJ1c3NlbGwg c2V0IiBkb2VzIGFuZCBhbHdheXMgd2lsbCBkbyBzbykuDQo+Pj4+Pg0KPj4+Pj4gT2YgY291 cnNlLCBpZiBWIGlzIHRoZSBzZXQgb2YgYWxsIHNldHMgdGhlbiBWIGUgVi4gKFN0aWxsIG5v IHByb2JsZW0gaW4gYW4NCj4+Pj4+IGFwcHJvcHJpYXRlIGF4aW9tYXRpYyBzZXQgdGhlb3J5 KS4NCj4+Pj4+DQo+Pj4+PiBJbiB0aGUgY29udGV4dCBvZiBaRihDKSwgb2YgY291cnNlLCB0 aGVyZSdzIG5vIHN1Y2ggc2V0Lg0KPj4+PiBNeSBrZXkgdW5pcXVlIGlubm92YXRpb24gdG8g dGhpcyBpcyB0aGF0IGEgc2V0IHRoYXQgY29udGFpbnMgaXRzZWxmDQo+Pj4+IGlzIGlzb21v cnBoaWMgdG8gYSBjYW4gb2Ygc291cCB0aGF0IGNvbnRhaW5zIGl0c2VsZiBzdWNoIHRoYXQg dGhpcyBjYW4NCj4+Pj4gb2Ygc291cCBoYXMgbm8gb3V0c2lkZSBzdXJmYWNlLg0KPj4+Pg0K Pj4+PiBTbyB3ZSBzaW1wbHkgbXVzdCBmb3JiaWQgYSBzZXQgZnJvbSBjb250YWluaW5nIGl0 c2VsZiBhcyBpbmNvaGVyZW50Lg0KPj4+PiAtLSANCj4+Pj4gQ29weXJpZ2h0IDIwMjMgT2xj b3R0ICJUYWxlbnQgaGl0cyBhIHRhcmdldCBubyBvbmUgZWxzZSBjYW4gaGl0OyBHZW5pdXMN Cj4+Pj4gaGl0cyBhIHRhcmdldCBubyBvbmUgZWxzZSBjYW4gc2VlLiIgQXJ0aHVyIFNjaG9w ZW5oYXVlcg0KPj4+DQo+Pj4NCj4+PiAiU28gd2Ugc2ltcGx5IG11c3QgZm9yYmlkIGEgc2V0 IGZyb20gY29udGFpbmluZyBpdHNlbGYgYXMgaW5jb2hlcmVudC4iDQo+Pj4NCj4+PiBTbyB5 b3Ugd2FudCB0byBmb3JiaWQgZXhhY3RseSB0aGlzOg0KPj4+IHsgeyB9IH0NCj4+IE5vLCB0 aGF0IGlzIG5vdCBhIHNldCBjb250YWluaW5nIGl0c2VsZi4NCj4+DQo+PiBVbmRlciBGcmVn ZSwgdGhpcyB7MSwyLDN9IGlzLg0KPiANCj4gWWVhaCwgeW91IGNvdWxkIGFsbW9zdCBpbnZl cnQgdGhpcyBhbmQgYXNrIHdoYXQgYSBzZXQgdGhhdCBkb2Vzbid0IGNvbnRhaW4gaXRzZWxm IHdvdWxkIGJlPw0KDQpBIHNldCB0aGF0IGRvZXMgY29udGFpbiBpdHNlbGYgaXMgaXNvbW9y cGhpYyB0byBhIGNhbiBvZiBzb3VwIHRoYXQNCnNvIHRvdGFsbHkgY29udGFpbnMgaXRzZWxm IHRoYXQgaXQgaGFzIG5vIG91dHNpZGUgc3VyZmFjZS4NCg0KQSBzZXQgdGhhdCBkb2VzIG5v dCBjb250YWluIGl0c2VsZiBpcyBpc29tb3JwaGljIHRvIGEgY2FuIG9mIHNvdXAgdGhhdCAN CmNvbnRhaW5zIHNvdXAuDQoNCj4gQnkgZGVmaW5pdGlvbiB0aGUgc2V0IGFzIGEgY29udGFp bmVyIGlzIHRvIGhhdmUgYW4gaWRlbnRpdHksIGFuZCBpZiBkb2VzIG5vdCBob2xkIHVwIHRo ZW4gaXQgd291bGQgYmUgYSBiYWRseSBjb25zdHJ1Y3RlZCBzZXQuDQo+IFRoZSBlbGVtZW50 cyB3aXRoaW4gdGhlIGN1cmx5IGJyYWNlcyBsaXRlcmFsbHkgYXJlIHRoZSBzZXQ7IG5vdCB0 aGUgYnJhY2VzIHRoZW1zZWx2ZXMuIFRoZXkgYXJlIGRlbGltaXRlcnMgb2Ygbm90YXRpb24u IFRvIHdvcnJ5IG92ZXIgYSB0ZWNobmljYWxpdHkgaW52b2x2aW5nIHRoZSBjdXJseSBicmFj ZXMsIHdoZW4gd2Ugb3JkaW5hcmlseSBoYXBwaWx5IGRpc2N1c3MgdGhlIHNldCBSIHdpdGhv dXQgYW55IGN1cmx5IGJyYWNlczogd291bGQgdGhpcyBwdXQgYWxsIG9mIHJlYWwgYW5hbHlz aXMgYXQgcmlzaz8gV2Uga25vdyB0aGF0IHdlIGNhbm5vdCBsaXN0IGFsbCBvZiBSLCBhbmQg dGhpcyBkb2VzIG5vdCBzdG9wIHVzLiBXZSByZWFkaWx5IG5hbWUgYSB2YWx1ZSAnYScgaW4g UiwgYW5kIHNvIGxvbmcgYXMgbm8gY29uc3RyYWludHMgYXJlIHBsYWNlZCB1cG9uIHRoaXMg dmFsdWUgdG8gd2hhdCBkZWdyZWUgaXMgaXQgUj8gWW91IGNlcnRhaW5seSBhcmUgbm90IGdv aW5nIHRvIHByb3ZlIHRoYXQgaXQgaXMgb25lIHNpbmd1bGFyIHZhbHVlLiBEb2VzIG5hbWlu ZyB0aGUgc2V0IHthLFJ9IGRvIGFueXRoaW5nPyBDYW4gdGhlIHZhcmlhYmxlIHRha2UgdGhp cyB0cmVhdG1lbnQ/IFdpdGhvdXQgdGhlIHZhcmlhYmxlIHdlIHdvdWxkIGJlIGJhZGx5IGhh bmRpY2FwcGVkLCBzbyB0byBkZW55IGl0IGRvZXNuJ3Qgc2VlbSB2ZXJ5IGZyaWVuZGx5LiBZ ZXQgbWF0aGVtYXRpY3MgbmVlZHMgdGhlIHZhcmlhYmxlLCBhbmQgaWYgYW55dGhpbmcgY291 bGQgc2VlbSBjb250cm92ZXJzaWFsIHRvIHRoZSBzdWJqZWN0IGl0IGlzIHRoZSBkYW5jaW5n IHZhbHVlIGluIGFuIG90aGVyd2lzZSBzdGF0aWMgbGFuZHNjYXBlLg0KPiANCj4gVGhhdCBv dXIgY29tcHV0ZXJzIGRvIGluIGZhY3QgaGF2ZSBzdHJpbmdlbnQgcmVxdWlyZW1lbnRzIG9u IHN1Y2ggZGV0YWlscywgYW5kIHRoZSBhYmlsaXR5IHRvIGRpc3Rpbmd1aXNoIGJldHdlZW4g Y29uc3RhbnQgYW5kIHZhcmlhYmxlOyBhbmQgdGhhdCBtYXRoZW1hdGljaWFucyBzbyBub3Qg Y2FyZTsgbm86IHRoaXMgaXMgbm90IHRoZSBjYXNlLiBUaGUgbWF0aGVtYXRpY2lhbnMgZG8g Y2FyZSBhbmQgZWFjaCBvbmUgdGhhdCBsZWFybnMgQyBhbmQgdHlwZSBzYWZldHkgYW5kIGNv bXBpbGVyIGxldmVsIGludGVncml0eSBoYXMgbWFkZSB0aGVpciB3YXkgaW50byBhY3R1YWwg Y29tcHV0aW5nIGhhcmR3YXJlLiBUaGF0IHN1Y2ggYSBtYXRoZW1hdGljaWFuIHdvdWxkIGNh cmUgdG8gZm9vbCB0aGVtc2VsdmVzIGludG8gYmVsaWV2aW5nIHRoYXQgdGhleSBjYW4gZG8g bW9yZSB0aGFuIHRoZWlyIGNvbXB1dGVyIGNhbiBieSBibG93aW5nIG9mZiB0aGVzZSByZXN0 cmljdGlvbnMgaXMgbm8gbG9uZ2VyIGEgY29udmluY2luZyBwb3NpdGlvbiB0byBob2xkLiBD b21wdXRpbmcgbGFuZ3VhZ2VzIGFib3VuZC4gUHJvY2Vzc29ycyBhcmUgbW9ycGhpbmcuIEtl ZXBpbmcgdXAgc2VlbXMgbmV4dCB0byBpbXBvc3NpYmxlLg0KPiANCj4gVGhlIGh1bWFuIGxv Z2ljIGJyZWFrcyBkb3duIHdlbGwgYmVmb3JlIG11Y2ggb2YgdGhpcywgYXMgd2hlbiB3ZSBk aXZpZGUgb25lIGludGVnZXIgYnkgYW5vdGhlciBhbmQgY2xhaW0gdG8gY29tZSBvdXQgdXBv biBhIGNvbnRpbnV1bS4gTXkgY29tcHV0ZXIgdGVsbHMgbWUgdGhhdCAxLzM9MCwgd2hlcmVh cyBtb2Rlcm4gaHVtYW5zIGJlbGlldmUgaXQgaXMgMC4zMzMuLi4gVGhpcyBpcyBxdWl0ZSBh IHNpbXBsZSBjb25mbGljdC4gRGl2aXNpb24gaXMgbm90IGZ1bmRhbWVudGFsLiBNaXhpbmcg b3BlcmF0b3JzIGludG8gdmFsdWVzIGlzIG5vdCBlbGVtZW50YWwuIFNvIG15IHZlcnkgdXNh Z2Ugb2YgUiBhYm92ZSBpcyBzdXNwZWN0LCBidXQgYmV5b25kIHRoYXQgSSBzdXBwb3NlIHRo ZSBwcm9ibGVtIGNvdWxkIGJlIHNpbXBsaWZpZWQgZG93biB0byBhIHNpbmd1bGFyIGRpZ2l0 LiBUaGF0IHdvdWxkIGJlIHF1aXRlIGNsZWFuLiBJcyB0aGVyZSBhbnkgZGlzdGluY3Rpb24g aW4gdGhlIHNldCBBPXsxLDIsMyw0LDUsNiw3LDgsOSwwfSwgYW5kIHdoZXJlIGEgaXMgaW4g QSwgQj17YSwxLDIsMyw0LDUsNiw3LDgsOSwwfT8gQ291bGQgSSBoYXZlIHNpbXBseSBzYWlk IHRoYXQgQj17YX0/IElzIHRoZSBpc3N1ZSBvZiBhIG11bHRpcGxpY2l0eSBvZiB2YWx1ZXMs IHZlcnN1cyB0aGUgc2luZ3VsYXIgdmFsdWUsIGZlbHQgYXMgYmx1cnJlZCBieSB0aGUgdXNh Z2Ugb2YgYSB2YXJpYWJsZT8gSSB0aGluayBpdCBkb2VzIGFmZmVjdCB0aGUgaW50ZXJwcmV0 YXRpb24uIFRvIHdoYXQgZGVncmVlIGFzIEkgaXNzdWUgc29tZSBkZWNyZWUgYWJvdXQgdGhl IHZhbHVlIHRocmVlIGRpZCBJIGRvIHNvIGluIEEsIGluIEIsIGluIHRoZSBpbnRlZ2Vycywg aW4gdGhlIFJlYWxzLCBldCBjZXRlcmEsIGV0IGNldGVyYT8gTXVzdCB0aGUgdmFsdWUgdGhy ZWUgd2hpY2ggSSBoYXZlIG1lbnRpb25lZCBpbiBmYWN0IGNhcnJ5IGl0cyBzZXQgaWRlbnRp dHkgd2l0aCBpdCwgdGhlbiBhIHNlbnNlIG9mIHR5cGUgaW1wZXJhdGl2ZSBpcyBmZWx0LiBU aGF0IHdlIHRvbyByZWFkaWx5IG1peCB0aGVzZSB0eXBlcywgYW5kIGNsYWltIHZhcmlvdXMg cmVzdWx0cyBhdCBvdXIgb3duIGNvbnZlbmllbmNlIGlzIHByb2JsZW1hdGljLiBBcyB0byB3 aGljaCBpcyB0aGUgZWxlbWVudGFsIHN5c3RlbTogd291bGQgc3VjaCBhIGJhc2lzIGJlIG9m IGludGVyZXN0Pw0KPiAgIA0KPiBJdCBzZWVtcyBhcyB0aG91Z2ggdGhlICd5ZXMnIGFuc3dl ciB3aWxsIGxhbmQgdXMgaW4gZGlzY3JldGUgc3lzdGVtcywgYW5kIGZvcnR1bmF0ZWx5IHRo ZXJlIGlzIG1vcmUgdG8gZGlzY3VzcyB0aGVyZSB0aGFuIGp1c3QgdGhlIG5hdHVyYWwgbnVt YmVyLiBJdCdzIGFsbW9zdCBhcyBpZiB0aGUgc3ViamVjdCBnb3QgcGFyZWQgZG93biB0byBm aXQgdGhlIHJlYWwgdmFsdWU7IGFsbW9zdCBhcyB0aGUgZnVuY2VycyBoYXZlIHN0dWNrIHRo ZWlyIHN0aW5reSBmaW5nZXJzIGludG8gZXZlcnkgb3JpZmljZS4gV2hlbiB5b3VyIG51bWJl cnMgaGF2ZSBiZWVuIGJ1aWx0IG9uIGZ1bmN0aW9ucywgYW5kIHlvdXIgYWRkaXRpb24gb3Bl cmF0b3IsIHRvbywgdGhlcmUgaXNuJ3QgcmVhbGx5IG11Y2ggbGVmdCB0byBkbyBidXQgdG8g YmVuZCBvdmVyIGZvciB0aGUgZnVuY2Vycy4gSXQgaXMgdG90YWxseSBhbmQgcHJvdmFibHkg dW5hY2NlcHRhYmxlLg0KDQotLSANCkNvcHlyaWdodCAyMDIzIE9sY290dCAiVGFsZW50IGhp dHMgYSB0YXJnZXQgbm8gb25lIGVsc2UgY2FuIGhpdDsgR2VuaXVzDQpoaXRzIGEgdGFyZ2V0 IG5vIG9uZSBlbHNlIGNhbiBzZWUuIiBBcnRodXIgU2Nob3BlbmhhdWVyDQoNCg==

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Fritz Feldhase@21:1/5 to FromTheRafters on Thu Nov 23 08:52:18 2023
    On Thursday, November 23, 2023 at 4:59:24 PM UTC+1, FromTheRafters wrote:

    { 1, 3, 4/4, 18 }

    Four symbols separated by three commas. I would say four elements. Cardinality four.

    C'mon. Don't be an idiot!

    Hint: If a = b = c = d, then card({a, b, c, d}) = 1.

    <faceplam>

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Fritz Feldhase@21:1/5 to olcott on Thu Nov 23 08:59:01 2023
    On Thursday, November 23, 2023 at 2:58:10 AM UTC+1, olcott wrote:

    a set that contains itself is isomorphic to a can of soup that contains itself such that this can
    of soup has no outside surface.

    If we have a set A such that A e A, say A = {A}, then we may indeed write (to get the idea):

    ... e A e A e A e A e ...

    :-)

    To exclude such a "situation" in ZF(C) we have the Axiom of Foundation there.

    See: https://mathworld.wolfram.com/AxiomofFoundation.html
    and: https://en.wikipedia.org/wiki/Axiom_of_regularity

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Fritz Feldhase@21:1/5 to FromTheRafters on Thu Nov 23 09:08:22 2023
    On Thursday, November 23, 2023 at 4:59:24 PM UTC+1, FromTheRafters wrote:

    How about this one?

    {{},elephant,gorrila,jackass}

    How about this one?

    {the author of Waverley, Sir Walter Scott} .

    Hint:

    Ax: x e {s, t} <-> x = s v x = t.

    So the question is: Are there two objects a, b (a =/= b) such that a e {the author of Waverley, Sir Walter Scott} and b e {the author of Waverley, Sir Walter Scott}?

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From FromTheRafters@21:1/5 to All on Thu Nov 23 13:06:17 2023
    Fritz Feldhase formulated on Thursday :
    On Thursday, November 23, 2023 at 4:59:24 PM UTC+1, FromTheRafters wrote:

    { 1, 3, 4/4, 18 }

    Four symbols separated by three commas. I would say four elements.
    Cardinality four.

    C'mon. Don't be an idiot!

    Hint: If a = b = c = d, then card({a, b, c, d}) = 1.

    <faceplam>

    Sure, but then it would not have been a set, but a multiset.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Fritz Feldhase@21:1/5 to FromTheRafters on Thu Nov 23 11:50:03 2023
    On Thursday, November 23, 2023 at 7:06:32 PM UTC+1, FromTheRafters wrote:
    Fritz Feldhase formulated on Thursday :
    On Thursday, November 23, 2023 at 4:59:24 PM UTC+1, FromTheRafters wrote:

    { 1, 3, 4/4, 18 }

    Four symbols separated by three commas. I would say four elements.
    Cardinality four.

    C'mon. Don't be an idiot! :-)

    Hint: If a = b = c = d, then card({a, b, c, d}) = 1.

    Sure, but then it would not have been a set, but a multiset.

    Huh?!

    Forget about it.

    EOD.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From FromTheRafters@21:1/5 to All on Thu Nov 23 17:28:28 2023
    Fritz Feldhase expressed precisely :
    On Thursday, November 23, 2023 at 7:06:32 PM UTC+1, FromTheRafters wrote:
    Fritz Feldhase formulated on Thursday :
    On Thursday, November 23, 2023 at 4:59:24 PM UTC+1, FromTheRafters wrote: >>>>>
    { 1, 3, 4/4, 18 }

    Four symbols separated by three commas. I would say four elements.
    Cardinality four.

    C'mon. Don't be an idiot! :-)

    Hint: If a = b = c = d, then card({a, b, c, d}) = 1.

    Sure, but then it would not have been a set, but a multiset.

    Huh?!

    For the cardinality of multisets, you add the multiplicities.

    Forget about it.

    Okay

    EOD.

    If you say so.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Adam Polak@21:1/5 to All on Thu Nov 23 21:22:11 2023
    czwartek, 23 listopada 2023 o 16:59:24 UTC+1 FromTheRafters napisał(a):
    Adam Polak presented the following explanation :
    czwartek, 23 listopada 2023 o 11:32:25 UTC+1 FromTheRafters napisał(a):
    After serious thinking Adam Polak wrote :
    czwartek, 23 listopada 2023 o 02:58:10 UTC+1 olcott napisał(a):
    On 11/22/2023 5:18 PM, Fritz Feldhase wrote:
    On Wednesday, November 22, 2023 at 11:31:32 PM UTC+1, olcott wrote: >>>>>
    Russell's Paradox, the Paradox of the set of all sets,
    These two have been abolished by (axiomatic set theory)
    https://en.wikipedia.org/wiki/Zermelo%E2%80%93Fraenkel_set_theory >>>>>> a very long time ago.

    Though there are axiomatic set theories which do allow for a set of all
    sets.

    This set does not necessarily lead to a set theoretic antinomy (though >>>>> "the Russell set" does and always will do so).

    Of course, if V is the set of all sets then V e V. (Still no problem in
    an appropriate axiomatic set theory).

    In the context of ZF(C), of course, there's no such set.
    My key unique innovation to this is that a set that contains itself >>>> is isomorphic to a can of soup that contains itself such that this can >>>> of soup has no outside surface.

    So we simply must forbid a set from containing itself as incoherent. >>>> --
    Copyright 2023 Olcott "Talent hits a target no one else can hit; Genius >>>> hits a target no one else can see." Arthur Schopenhauer


    "So we simply must forbid a set from containing itself as incoherent." >>>
    So you want to forbid exactly this:
    { { } }
    No, that is not a set containing itself.

    Under Frege, this {1,2,3} is.


    " { { } } <- No, that is not a set containing itself. "
    Is that what you think? :)
    I know this.
    let's start with one very simple question:
    how many elements does this set contain? : :
    { 1, 3, 4/4, 18 }
    Four symbols separated by three commas. I would say four elements. Cardinality four.

    How about this one?

    {{},elephant,gorrila,jackass}

    Set: { 1, 3, 4/4, 18 } how many elements contain ?
    Four symbols separated by three commas. I would say four elements. Cardinality four.
    OK, let me ask you another question befor I'll aswer your:
    Set: { 1, 3, 1.0000... , 18 } how many elements contain ?

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Chris M. Thomasson@21:1/5 to FromTheRafters on Thu Nov 23 22:51:44 2023
    On 11/23/2023 10:06 AM, FromTheRafters wrote:
    Fritz Feldhase formulated on Thursday :
    On Thursday, November 23, 2023 at 4:59:24 PM UTC+1, FromTheRafters wrote: >>
    { 1, 3, 4/4, 18 }

    Four symbols separated by three commas. I would say four elements.
    Cardinality four.

    C'mon. Don't be an idiot!

    Hint: If a = b = c = d, then card({a, b, c, d}) = 1.

    <faceplam>

    Sure, but then it would not have been a set, but a multiset.

    As a programmer, I see 4 elements. However, lets reduce and remove
    duplicates:

    { 1, 3, 4/4, 18 }

    Can be:

    { 1, 3, 1, 18 }

    Remove duplicates:

    { 1, 3, 18 }

    ?

    ;^)

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From FromTheRafters@21:1/5 to All on Fri Nov 24 02:23:06 2023
    Chris M. Thomasson submitted this idea :
    On 11/23/2023 10:06 AM, FromTheRafters wrote:
    Fritz Feldhase formulated on Thursday :
    On Thursday, November 23, 2023 at 4:59:24 PM UTC+1, FromTheRafters wrote: >>>
    { 1, 3, 4/4, 18 }

    Four symbols separated by three commas. I would say four elements.
    Cardinality four.

    C'mon. Don't be an idiot!

    Hint: If a = b = c = d, then card({a, b, c, d}) = 1.

    <faceplam>

    Sure, but then it would not have been a set, but a multiset.

    As a programmer, I see 4 elements. However, lets reduce and remove duplicates:

    There are no duplicates in a ZFC set. In a multiset say:

    [a,a,a,b,b,c,c,c,c]

    You add the multiplicities, three a's two b's and four c's for a
    cardinality of nine.

    { 1, 3, 4/4, 18 }

    Can be:

    { 1, 3, 1, 18 }

    Remove duplicates:

    { 1, 3, 18 }

    ?

    A set with cardinality of three.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From FromTheRafters@21:1/5 to After serious thinking Adam Polak on Fri Nov 24 02:24:58 2023
    After serious thinking Adam Polak wrote :
    czwartek, 23 listopada 2023 o 16:59:24 UTC+1 FromTheRafters napisał(a):
    Adam Polak presented the following explanation :
    czwartek, 23 listopada 2023 o 11:32:25 UTC+1 FromTheRafters napisał(a): >>>> After serious thinking Adam Polak wrote :
    czwartek, 23 listopada 2023 o 02:58:10 UTC+1 olcott napisał(a):
    On 11/22/2023 5:18 PM, Fritz Feldhase wrote:
    On Wednesday, November 22, 2023 at 11:31:32 PM UTC+1, olcott wrote: >>>>>>>
    Russell's Paradox, the Paradox of the set of all sets,
    These two have been abolished by (axiomatic set theory)
    https://en.wikipedia.org/wiki/Zermelo%E2%80%93Fraenkel_set_theory >>>>>>>> a very long time ago.

    Though there are axiomatic set theories which do allow for a set of all >>>>>>> sets.

    This set does not necessarily lead to a set theoretic antinomy (though >>>>>>> "the Russell set" does and always will do so).

    Of course, if V is the set of all sets then V e V. (Still no problem in >>>>>>> an appropriate axiomatic set theory).

    In the context of ZF(C), of course, there's no such set.
    My key unique innovation to this is that a set that contains itself >>>>>> is isomorphic to a can of soup that contains itself such that this can >>>>>> of soup has no outside surface.

    So we simply must forbid a set from containing itself as incoherent. >>>>>> --
    Copyright 2023 Olcott "Talent hits a target no one else can hit; Genius >>>>>> hits a target no one else can see." Arthur Schopenhauer


    "So we simply must forbid a set from containing itself as incoherent." >>>>>
    So you want to forbid exactly this:
    { { } }
    No, that is not a set containing itself.

    Under Frege, this {1,2,3} is.


    " { { } } <- No, that is not a set containing itself. "
    Is that what you think? :) I know this.
    let's start with one very simple question:
    how many elements does this set contain? : :
    { 1, 3, 4/4, 18 }
    Four symbols separated by three commas. I would say four elements.
    Cardinality four.

    How about this one?

    {{},elephant,gorrila,jackass}

    Set: { 1, 3, 4/4, 18 } how many elements contain ?
    Four symbols separated by three commas. I would say four elements.
    Cardinality four.
    OK, let me ask you another question befor I'll aswer your:
    Set: { 1, 3, 1.0000... , 18 } how many elements contain ?

    A four element multiset.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Chris M. Thomasson@21:1/5 to FromTheRafters on Fri Nov 24 00:06:13 2023
    On 11/23/2023 11:23 PM, FromTheRafters wrote:
    Chris M. Thomasson submitted this idea :
    On 11/23/2023 10:06 AM, FromTheRafters wrote:
    Fritz Feldhase formulated on Thursday :
    On Thursday, November 23, 2023 at 4:59:24 PM UTC+1, FromTheRafters
    wrote:

    { 1, 3, 4/4, 18 }

    Four symbols separated by three commas. I would say four elements.
    Cardinality four.

    C'mon. Don't be an idiot!

    Hint: If a = b = c = d, then card({a, b, c, d}) = 1.

    <faceplam>

    Sure, but then it would not have been a set, but a multiset.

    As a programmer, I see 4 elements. However, lets reduce and remove
    duplicates:

    There are no duplicates in a ZFC set. In a multiset say:

    [a,a,a,b,b,c,c,c,c]

    You add the multiplicities, three a's two b's and four c's for a
    cardinality of nine.

    { 1, 3, 4/4, 18 }

    Can be:

    { 1, 3, 1, 18 }

    Remove duplicates:

    { 1, 3, 18 }

    ?

    A set with cardinality of three.

    3-ary finite set... Fair enough?

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to Adam Polak on Fri Nov 24 10:58:21 2023
    On 24.11.2023 06:22, Adam Polak wrote:

    OK, let me ask you another question befor I'll aswer your:
    Set: { 1, 3, 1.0000... , 18 } how many elements contain ?

    That depends on what you look for. There are four representations of
    three quantities.

    If we try to index all fractions in

    1, 1/2, 1/3, 1/4, ...
    2, 2/2, 2/3, 2/4, ...
    3, 3/2, 3/3, 3/4, ...
    4, 4/2, 4/3, 4/4, ...
    5, 5/2, 5/3, 5/4, ...
    ...

    then we can apply the closed formula k = (m + n - 1)(m + n - 2)/2 + m
    leading to the sequence
    1/1, 1/2, 2/1, 1/3, 2/2, 3/1, 1/4, 2/3, 3/2, 4/1, 1/5, 2/4, 3/3, 4/2,
    5/1, 1/6, 2/5, 3/4, 4/3, 5/2, 6/1, ... .
    If we try to index the positive rational numbers, then we have to delete
    the doublets.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Adam Polak@21:1/5 to All on Fri Nov 24 01:49:47 2023
    piątek, 24 listopada 2023 o 08:25:12 UTC+1 FromTheRafters napisał(a):
    After serious thinking Adam Polak wrote :
    czwartek, 23 listopada 2023 o 16:59:24 UTC+1 FromTheRafters napisał(a):
    Adam Polak presented the following explanation :
    czwartek, 23 listopada 2023 o 11:32:25 UTC+1 FromTheRafters napisał(a): >>>> After serious thinking Adam Polak wrote :
    czwartek, 23 listopada 2023 o 02:58:10 UTC+1 olcott napisał(a): >>>>>> On 11/22/2023 5:18 PM, Fritz Feldhase wrote:
    On Wednesday, November 22, 2023 at 11:31:32 PM UTC+1, olcott wrote:

    Russell's Paradox, the Paradox of the set of all sets,
    These two have been abolished by (axiomatic set theory)
    https://en.wikipedia.org/wiki/Zermelo%E2%80%93Fraenkel_set_theory >>>>>>>> a very long time ago.

    Though there are axiomatic set theories which do allow for a set of all
    sets.

    This set does not necessarily lead to a set theoretic antinomy (though
    "the Russell set" does and always will do so).

    Of course, if V is the set of all sets then V e V. (Still no problem in
    an appropriate axiomatic set theory).

    In the context of ZF(C), of course, there's no such set.
    My key unique innovation to this is that a set that contains itself >>>>>> is isomorphic to a can of soup that contains itself such that this can
    of soup has no outside surface.

    So we simply must forbid a set from containing itself as incoherent. >>>>>> --
    Copyright 2023 Olcott "Talent hits a target no one else can hit; Genius
    hits a target no one else can see." Arthur Schopenhauer


    "So we simply must forbid a set from containing itself as incoherent." >>>>>
    So you want to forbid exactly this:
    { { } }
    No, that is not a set containing itself.

    Under Frege, this {1,2,3} is.


    " { { } } <- No, that is not a set containing itself. "
    Is that what you think? :) I know this.
    let's start with one very simple question:
    how many elements does this set contain? : :
    { 1, 3, 4/4, 18 }
    Four symbols separated by three commas. I would say four elements.
    Cardinality four.

    How about this one?

    {{},elephant,gorrila,jackass}

    Set: { 1, 3, 4/4, 18 } how many elements contain ?
    Four symbols separated by three commas. I would say four elements.
    Cardinality four.
    OK, let me ask you another question befor I'll aswer your:
    Set: { 1, 3, 1.0000... , 18 } how many elements contain ?
    A four element multiset.

    to justify your answer: "... four elements. Cardinality four."
    wrong answer in the context of the Set theory that is based on ZF(C) axiomatics,
    you moved to the area of "multiset" which is incompatible with ZF(C) so with the Set theory.

    We learn from this that one can disagree with ZF(C) Set theory and nothing terrible happen.
    Good to notice.

    "
    Set: { 1, 3, 4/4, 18 } how many elements contain ?
    Four symbols separated by three commas. I would say four elements. Cardinality four.
    "
    what happened that you didn't recognize 4/4 as 1
    as "the number ONE"
    and that, in accordance with Set theory, you did not answer: three elements ? just think it over

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From FromTheRafters@21:1/5 to Adam Polak on Fri Nov 24 08:11:39 2023
    Adam Polak wrote on 11/24/2023 :
    piątek, 24 listopada 2023 o 08:25:12 UTC+1 FromTheRafters napisał(a):
    After serious thinking Adam Polak wrote :
    czwartek, 23 listopada 2023 o 16:59:24 UTC+1 FromTheRafters napisał(a): >>>> Adam Polak presented the following explanation :
    czwartek, 23 listopada 2023 o 11:32:25 UTC+1 FromTheRafters napisał(a): >>>>>> After serious thinking Adam Polak wrote :
    czwartek, 23 listopada 2023 o 02:58:10 UTC+1 olcott napisał(a): >>>>>>>> On 11/22/2023 5:18 PM, Fritz Feldhase wrote:
    On Wednesday, November 22, 2023 at 11:31:32 PM UTC+1, olcott wrote: >>>>>>>>>
    Russell's Paradox, the Paradox of the set of all sets,
    These two have been abolished by (axiomatic set theory)
    https://en.wikipedia.org/wiki/Zermelo%E2%80%93Fraenkel_set_theory >>>>>>>>>> a very long time ago.

    Though there are axiomatic set theories which do allow for a set of >>>>>>>>> all sets.

    This set does not necessarily lead to a set theoretic antinomy >>>>>>>>> (though "the Russell set" does and always will do so).

    Of course, if V is the set of all sets then V e V. (Still no problem >>>>>>>>> in an appropriate axiomatic set theory).

    In the context of ZF(C), of course, there's no such set.
    My key unique innovation to this is that a set that contains itself >>>>>>>> is isomorphic to a can of soup that contains itself such that this can >>>>>>>> of soup has no outside surface.

    So we simply must forbid a set from containing itself as incoherent. >>>>>>>> --
    Copyright 2023 Olcott "Talent hits a target no one else can hit; >>>>>>>> Genius hits a target no one else can see." Arthur Schopenhauer >>>>>>>

    "So we simply must forbid a set from containing itself as incoherent." >>>>>>>
    So you want to forbid exactly this:
    { { } }
    No, that is not a set containing itself.

    Under Frege, this {1,2,3} is.


    " { { } } <- No, that is not a set containing itself. "
    Is that what you think? :) I know this.
    let's start with one very simple question:
    how many elements does this set contain? : :
    { 1, 3, 4/4, 18 }
    Four symbols separated by three commas. I would say four elements.
    Cardinality four.

    How about this one?

    {{},elephant,gorrila,jackass}

    Set: { 1, 3, 4/4, 18 } how many elements contain ?
    Four symbols separated by three commas. I would say four elements.
    Cardinality four.
    OK, let me ask you another question befor I'll aswer your:
    Set: { 1, 3, 1.0000... , 18 } how many elements contain ?
    A four element multiset.

    to justify your answer: "... four elements. Cardinality four."
    wrong answer in the context of the Set theory that is based on ZF(C) axiomatics, you moved to the area of "multiset" which is incompatible with ZF(C) so with the Set theory.

    We learn from this that one can disagree with ZF(C) Set theory and nothing terrible happen. Good to notice.

    "
    Set: { 1, 3, 4/4, 18 } how many elements contain ?
    Four symbols separated by three commas. I would say four elements.
    Cardinality four.
    "
    what happened that you didn't recognize 4/4 as 1
    as "the number ONE"

    I didn't recognize that collection as a set, but as a multiset, because
    ZFC sets don't have duplicate elements.

    and that, in accordance with Set theory, you did not answer: three elements ? just think it over

    Yes, you are correct. I should have because the symbol 4/4 and the
    symbol 1 are the same number just like 1/2 and .5 and .4(9) are all the
    same number.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Timothy Golden@21:1/5 to Adam Polak on Fri Nov 24 14:17:37 2023
    On Friday, November 24, 2023 at 4:49:53 AM UTC-5, Adam Polak wrote:
    piątek, 24 listopada 2023 o 08:25:12 UTC+1 FromTheRafters napisał(a):
    After serious thinking Adam Polak wrote :
    czwartek, 23 listopada 2023 o 16:59:24 UTC+1 FromTheRafters napisał(a):
    Adam Polak presented the following explanation :
    czwartek, 23 listopada 2023 o 11:32:25 UTC+1 FromTheRafters napisał(a):
    After serious thinking Adam Polak wrote :
    czwartek, 23 listopada 2023 o 02:58:10 UTC+1 olcott napisał(a): >>>>>> On 11/22/2023 5:18 PM, Fritz Feldhase wrote:
    On Wednesday, November 22, 2023 at 11:31:32 PM UTC+1, olcott wrote:

    Russell's Paradox, the Paradox of the set of all sets,
    These two have been abolished by (axiomatic set theory)
    https://en.wikipedia.org/wiki/Zermelo%E2%80%93Fraenkel_set_theory >>>>>>>> a very long time ago.

    Though there are axiomatic set theories which do allow for a set of all
    sets.

    This set does not necessarily lead to a set theoretic antinomy (though
    "the Russell set" does and always will do so).

    Of course, if V is the set of all sets then V e V. (Still no problem in
    an appropriate axiomatic set theory).

    In the context of ZF(C), of course, there's no such set.
    My key unique innovation to this is that a set that contains itself >>>>>> is isomorphic to a can of soup that contains itself such that this can
    of soup has no outside surface.

    So we simply must forbid a set from containing itself as incoherent.
    --
    Copyright 2023 Olcott "Talent hits a target no one else can hit; Genius
    hits a target no one else can see." Arthur Schopenhauer


    "So we simply must forbid a set from containing itself as incoherent."

    So you want to forbid exactly this:
    { { } }
    No, that is not a set containing itself.

    Under Frege, this {1,2,3} is.


    " { { } } <- No, that is not a set containing itself. "
    Is that what you think? :) I know this.
    let's start with one very simple question:
    how many elements does this set contain? : :
    { 1, 3, 4/4, 18 }
    Four symbols separated by three commas. I would say four elements.
    Cardinality four.

    How about this one?

    {{},elephant,gorrila,jackass}

    Set: { 1, 3, 4/4, 18 } how many elements contain ?
    Four symbols separated by three commas. I would say four elements.
    Cardinality four.
    OK, let me ask you another question befor I'll aswer your:
    Set: { 1, 3, 1.0000... , 18 } how many elements contain ?
    A four element multiset.
    to justify your answer: "... four elements. Cardinality four."
    wrong answer in the context of the Set theory that is based on ZF(C) axiomatics,
    you moved to the area of "multiset" which is incompatible with ZF(C) so with the Set theory.

    We learn from this that one can disagree with ZF(C) Set theory and nothing terrible happen.
    Good to notice.
    "
    Set: { 1, 3, 4/4, 18 } how many elements contain ?
    Four symbols separated by three commas. I would say four elements. Cardinality four.
    "
    what happened that you didn't recognize 4/4 as 1
    as "the number ONE"
    and that, in accordance with Set theory, you did not answer: three elements ?
    just think it over

    It's plenty good, and the set is unnamed too. Because it is the only one you talk about you get to call it 'the set' but in this regard the nameless set is the universe to a physical interpretation. That the elements of the universe are not unique; that
    they are redundant; it is a matter of identifying individuals by locality which gives it enough to go on. Do sets require geometry? They weren't supposed to. The universe however, as if it was a set, will require geometry. At least in a thin sliver of
    thought, as if set theory could take it all in, would be arguable.

    As if some means of order could ensue in even a 3D static snapshop of the universe, such that over in Andromeda's Pleides wing Earth has been detected over on Mylkywhy three over Pleides twice off the Saga. OK, I suck at astronomy, and I apologize, in
    advance, for wasting precious resources; as if spending was going out of style. The Freegan ways are Freegan waves, and free as free can be, but for free will we've got a till of treasures and tools, ropes, and things.

    I've nearly gotten to the wheel now.

    Bearings: about this simplest way to bare quickly with stability is to select a bowed piece of material. It's center of mass will occur beneath its balance point, which is of course the bearing position. Sometimes a nail, nowadays even a washer or two,
    and oil if you want the damn thing to work in less than a storm. I see balanced props spin so freely they fly off their bearing. Escape artists.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Timothy Golden@21:1/5 to FromTheRafters on Fri Nov 24 14:37:34 2023
    On Friday, November 24, 2023 at 8:11:55 AM UTC-5, FromTheRafters wrote:
    Adam Polak wrote on 11/24/2023 :
    piątek, 24 listopada 2023 o 08:25:12 UTC+1 FromTheRafters napisał(a):
    After serious thinking Adam Polak wrote :
    czwartek, 23 listopada 2023 o 16:59:24 UTC+1 FromTheRafters napisał(a): >>>> Adam Polak presented the following explanation :
    czwartek, 23 listopada 2023 o 11:32:25 UTC+1 FromTheRafters napisał(a):
    After serious thinking Adam Polak wrote :
    czwartek, 23 listopada 2023 o 02:58:10 UTC+1 olcott napisał(a): >>>>>>>> On 11/22/2023 5:18 PM, Fritz Feldhase wrote:
    On Wednesday, November 22, 2023 at 11:31:32 PM UTC+1, olcott wrote:

    Russell's Paradox, the Paradox of the set of all sets,
    These two have been abolished by (axiomatic set theory) >>>>>>>>>> https://en.wikipedia.org/wiki/Zermelo%E2%80%93Fraenkel_set_theory >>>>>>>>>> a very long time ago.

    Though there are axiomatic set theories which do allow for a set of
    all sets.

    This set does not necessarily lead to a set theoretic antinomy >>>>>>>>> (though "the Russell set" does and always will do so).

    Of course, if V is the set of all sets then V e V. (Still no problem
    in an appropriate axiomatic set theory).

    In the context of ZF(C), of course, there's no such set.
    My key unique innovation to this is that a set that contains itself >>>>>>>> is isomorphic to a can of soup that contains itself such that this can
    of soup has no outside surface.

    So we simply must forbid a set from containing itself as incoherent.
    --
    Copyright 2023 Olcott "Talent hits a target no one else can hit; >>>>>>>> Genius hits a target no one else can see." Arthur Schopenhauer >>>>>>>

    "So we simply must forbid a set from containing itself as incoherent."

    So you want to forbid exactly this:
    { { } }
    No, that is not a set containing itself.

    Under Frege, this {1,2,3} is.


    " { { } } <- No, that is not a set containing itself. "
    Is that what you think? :) I know this.
    let's start with one very simple question:
    how many elements does this set contain? : :
    { 1, 3, 4/4, 18 }
    Four symbols separated by three commas. I would say four elements.
    Cardinality four.

    How about this one?

    {{},elephant,gorrila,jackass}

    Set: { 1, 3, 4/4, 18 } how many elements contain ?
    Four symbols separated by three commas. I would say four elements.
    Cardinality four.
    OK, let me ask you another question befor I'll aswer your:
    Set: { 1, 3, 1.0000... , 18 } how many elements contain ?
    A four element multiset.

    to justify your answer: "... four elements. Cardinality four."
    wrong answer in the context of the Set theory that is based on ZF(C) axiomatics, you moved to the area of "multiset" which is incompatible with ZF(C) so with the Set theory.

    We learn from this that one can disagree with ZF(C) Set theory and nothing terrible happen. Good to notice.

    "
    Set: { 1, 3, 4/4, 18 } how many elements contain ?
    Four symbols separated by three commas. I would say four elements.
    Cardinality four.
    "
    what happened that you didn't recognize 4/4 as 1
    as "the number ONE"
    I didn't recognize that collection as a set, but as a multiset, because
    ZFC sets don't have duplicate elements.
    and that, in accordance with Set theory, you did not answer: three elements ?
    just think it over
    Yes, you are correct. I should have because the symbol 4/4 and the
    symbol 1 are the same number just like 1/2 and .5 and .4(9) are all the
    same number.

    I really have to differ. The decimal notation is pure, and its scaled form is suggestive of a remap of unity. Indeed, actual and efficient processes will pick their harmonic boundaries wisely, I would think. For instance with a clock running at 1GHz, and
    memory running at say 0.7 of this frequency, might not make great sense. In this regard division has its problems. So that this claim of purity within the decimal notation does actually reflect back upon the others. Nobody actually said that products are
    so easy, either. Things were sweeter back when multiplication just meant addition a whole bunch of times. Now barrel shifters and zero detecting counters chop the thing up. Could there be something to these timing awarenesses? The child's product could
    be long and slow and laborious. Meanwhile chop suey is flying off the gpu, and the sauce is hot. If you redesign your machine to work in blocks of seven in terms of a DMA thing; essentially widening the internal bus to 7 words, at 1/7 the cost will get
    you your clean synched run, assuming one run per ram cycle. Is that a thing? No doubt if it is a good idea somebody has done it. Blocks in RAM; tetris. Cheers.

    Oddly enough, at three the 700MHz RAM would

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Fritz Feldhase@21:1/5 to FromTheRafters on Fri Nov 24 20:30:31 2023
    On Friday, November 24, 2023 at 2:11:55 PM UTC+1, FromTheRafters wrote:

    ZFC sets don't have duplicate elements.

    Right. But this just means that, say,

    {1, 2, 3, 2} = {1, 2, 3}.

    Don't mix up the term used to denote a certain set with the set itself.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Fritz Feldhase@21:1/5 to FromTheRafters on Fri Nov 24 20:19:48 2023
    On Friday, November 24, 2023 at 2:11:55 PM UTC+1, FromTheRafters wrote:

    the symbol 4/4 and the symbol 1 are the same number just like 1/2 and .5 and .4(9) are all the same number.

    Just for clarity: The symbol "4/4" and the symbol "1" are denoting (refer to) the same number (namely the number 1) just like "1/2", ".5" and ".4(9)" (usually) all denote (refer to) the same number (namely the number one-half).

    You see, the symbol "1" (most likely) is not an element in IN ("1" !e IN), but the number 1 is (1 e IN).

    Again, "Paris" is a word consisting of 5 characters, while Paris is a town (most likely not consiting of characters).

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Fritz Feldhase@21:1/5 to Timothy Golden on Fri Nov 24 20:35:09 2023
    On Friday, November 24, 2023 at 11:17:43 PM UTC+1, Timothy Golden wrote:

    Set: {1, 3, 4/4, 18} how many elements [does it] contain?

    It's plenty good, and the set is unnamed too.

    Nonsense, you silly crank. One name of the set we are talking about _is mentioned above_. It is "{1, 3, 4/4, 18}".

    <psychotic bullshit deleted>

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Chris M. Thomasson@21:1/5 to Chris M. Thomasson on Mon Nov 27 14:32:45 2023
    On 11/24/2023 12:06 AM, Chris M. Thomasson wrote:
    On 11/23/2023 11:23 PM, FromTheRafters wrote:
    Chris M. Thomasson submitted this idea :
    On 11/23/2023 10:06 AM, FromTheRafters wrote:
    Fritz Feldhase formulated on Thursday :
    On Thursday, November 23, 2023 at 4:59:24 PM UTC+1, FromTheRafters >>>>> wrote:

    { 1, 3, 4/4, 18 }

    Four symbols separated by three commas. I would say four elements. >>>>>> Cardinality four.

    C'mon. Don't be an idiot!

    Hint: If a = b = c = d, then card({a, b, c, d}) = 1.

    <faceplam>

    Sure, but then it would not have been a set, but a multiset.

    As a programmer, I see 4 elements. However, lets reduce and remove
    duplicates:

    There are no duplicates in a ZFC set. In a multiset say:

    [a,a,a,b,b,c,c,c,c]

    You add the multiplicities, three a's two b's and four c's for a
    cardinality of nine.

    { 1, 3, 4/4, 18 }

    Can be:

    { 1, 3, 1, 18 }

    Remove duplicates:

    { 1, 3, 18 }

    ?

    A set with cardinality of three.

    3-ary finite set... Fair enough?

    Take any set:

    Fwiw, just for fun, we can use those elements as a root in a n-ary tree.
    Notice the levels of the tree here, take note of the root node at 0:

    l[0] = { 0 } // root! :^)
    l[1] = { 1, 2 }
    l[2] = { 3, 4, 5, 6 }
    l[3] = { 7, 8, 9, 10, 11, 12, 13, 14 }
    l[4] = { 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, ect}
    ...

    Notice the pattern? So, say we have {1, 3, 8}. Each element can be a
    infinite tree:

    1 has two children { 3, 4 }
    3 has two children { 7, 8 }
    8 has two children { 17, 18 }

    on and on:

    https://youtu.be/oRrlRbGT-LU


    So, there are three infinite independent 2-ary fractal trees for the
    finite set of { 1, 3, 8 }


    1
    / \
    3 4
    [.....]
    _________

    3
    / \
    7 8
    [.....]
    _________

    8
    / \
    17 18
    [.....]
    _________


    This is fun to me. These trees can be multi n-ary on a per node and/or
    level basis. This example is for 2-ary.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From FromTheRafters@21:1/5 to All on Tue Nov 28 01:43:04 2023
    Chris M. Thomasson expressed precisely :
    On 11/23/2023 11:23 PM, FromTheRafters wrote:
    Chris M. Thomasson submitted this idea :
    On 11/23/2023 10:06 AM, FromTheRafters wrote:
    Fritz Feldhase formulated on Thursday :
    On Thursday, November 23, 2023 at 4:59:24 PM UTC+1, FromTheRafters >>>>> wrote:

    { 1, 3, 4/4, 18 }

    Four symbols separated by three commas. I would say four elements. >>>>>> Cardinality four.

    C'mon. Don't be an idiot!

    Hint: If a = b = c = d, then card({a, b, c, d}) = 1.

    <faceplam>

    Sure, but then it would not have been a set, but a multiset.

    As a programmer, I see 4 elements. However, lets reduce and remove
    duplicates:

    There are no duplicates in a ZFC set. In a multiset say:

    [a,a,a,b,b,c,c,c,c]

    You add the multiplicities, three a's two b's and four c's for a
    cardinality of nine.

    { 1, 3, 4/4, 18 }

    Can be:

    { 1, 3, 1, 18 }

    Neither are correct roster form set notation. Sets don't have repeated elements. If you want to indicate a multiset then use square brackets.

    Remove duplicates:

    { 1, 3, 18 }

    ?

    A set with cardinality of three.

    3-ary finite set... Fair enough?

    Sure, if you remove the duplicates, it is correct roster form notation.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Fritz Feldhase@21:1/5 to FromTheRafters on Tue Nov 28 06:56:10 2023
    On Tuesday, November 28, 2023 at 7:43:16 AM UTC+1, FromTheRafters wrote:

    | {1, 3, 4/4, 18}
    | can be:
    | {1, 3, 1, 18}

    or just {1, 3, 18}.

    Neither are correct roster form set notation.

    Sure they are.

    Sets don't have repeated elements.

    It seems to me that you are mixing up the term denoting (referring to) a set with the set which is denoted (referred to) by that term.

    Hint: A quite common definition schema for the "roster form set notation" (in the context of axiomatic set theory) is just

    | x e {a_1, ..., a_n} <-> x e a_1 v ... v x e a_n .

    We (usually?) do NOT require a_i =/= a_j here for i,j e {1, ..., n}, i =/= j. (At least I've never seen such a restriction in this connection.)

    Without such a definition all is just mumbo-jumbo.

    if you remove the duplicates, it is correct roster form notation.

    Again, a /set/ (in the context of axiomatic set theory) simply cannot have "duplicates".

    1 e {1, 1, 1} & 1 e {1} and Ax(x =/= 1 -> x !e {1, 1, 1} & x !e {1}). That's all there is to it.

    Hence, when dealing with /multisets/ I'd propose to use an alternative notation.

    See: https://www.proofwiki.org/wiki/Definition:Multiset#Notation

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Fritz Feldhase@21:1/5 to FromTheRafters on Tue Nov 28 06:51:03 2023
    On Tuesday, November 28, 2023 at 7:43:16 AM UTC+1, FromTheRafters wrote:

    | {1, 3, 4/4, 18}
    | can be:
    | {1, 3, 1, 18}

    or just {1, 3, 18}.

    Neither are correct roster form set notation.

    Sure they are.

    Sets don't have repeated elements.

    It seems to me that you are mixing up the term denoting (refering to) a set with the set which is denoted (referred to) by that term.

    Hint: A quite common definition schema for the "roster form set notation" (in the context of axiomatic set theory) is just

    | x e {a_1, ..., a_n} <-> x e a_1 v ... v a_n .

    We (usually?) do NOT exclude a_i = a_j here for i,j e {1, ..., n}, i =/= j. (At least I've never seen such a restriction in this connextion)

    Without such a definition all is just smoke and mirrors.

    if you remove the duplicates, it is correct roster form notation.

    Again, a /set/ (in the context of axiomatic set theory) simply cannot have "duplicates".

    1 e {1, 1, 1} & 1 e {1} and Ax(x =/= 1 -> x !e {1, 1, 1} & x !e {1}). That's all there is to it.

    Hence, when dealing with /multisets/ I'd propose to use an alternative notation.

    See: https://www.proofwiki.org/wiki/Definition:Multiset#Notation

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Fritz Feldhase@21:1/5 to Fritz Feldhase on Tue Nov 28 07:27:52 2023
    On Tuesday, November 28, 2023 at 3:56:17 PM UTC+1, Fritz Feldhase wrote:
    On Tuesday, November 28, 2023 at 7:43:16 AM UTC+1, FromTheRafters wrote:

    Neither are correct roster form set notation.

    Sure they are.

    You may check this, for example: https://proofwiki.org/wiki/Existence_of_Singleton_Set

    We (usually?) do NOT require a_i =/= a_j here for i,j e {1, ..., n}, i =/= j.

    For example:

    "_Curly bracket notation_

    We often define sets by listing their elements [...]:

    • The symbol {x, y, z} describes the set whose elements are precisely x, y, and z."

    You see, x = y = z = 1 (say) is not excluded.

    [Btw. A formal version of this definition would just be: x e {a, b, c} <-> x e a v x e b v x e c.]

    Source: https://math.mit.edu/~jhirsh/top_lecture.pdf

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Adam Polak@21:1/5 to All on Wed Nov 29 00:26:44 2023
    wtorek, 28 listopada 2023 o 16:27:59 UTC+1 Fritz Feldhase napisał(a):
    On Tuesday, November 28, 2023 at 3:56:17 PM UTC+1, Fritz Feldhase wrote:
    On Tuesday, November 28, 2023 at 7:43:16 AM UTC+1, FromTheRafters wrote:

    Neither are correct roster form set notation.

    Sure they are.
    You may check this, for example: https://proofwiki.org/wiki/Existence_of_Singleton_Set
    We (usually?) do NOT require a_i =/= a_j here for i,j e {1, ..., n}, i =/= j.
    For example:

    "_Curly bracket notation_

    We often define sets by listing their elements [...]:

    • The symbol {x, y, z} describes the set whose elements are precisely x, y, and z."

    You see, x = y = z = 1 (say) is not excluded.

    [Btw. A formal version of this definition would just be: x e {a, b, c} <-> x e a v x e b v x e c.]

    Source: https://math.mit.edu/~jhirsh/top_lecture.pdf

    "
    Sure they are.
    You may check this, for example: https://proofwiki.org/wiki/Existence_of_Singleton_Set
    "
    Proofs based on axioms :))
    It's really amusing.
    Axioms, unfortunately, being in it's important part internally contradictory, so flawed, in a way that cannot be questioned.

    To say that something is true or a correct description of reality just because an axiom says so, or it follows from an axiom,
    is exactly the same as saying that
    God exists because it follows from the content of the Roman Catholic Church catechism.

    Is it really so difficult to notice, to realize that using such methodologies of proving pushes you out from the realm of SCIENCE into the realm of an unscientific RELIGIOUS SECT?

    An axiom is not an argument, much less a proof or a basis for proof!

    Have a nice day.
    Regards,
    Adam

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Asterix@21:1/5 to All on Wed Nov 29 00:24:40 2023
    wtorek, 28 listopada 2023 o 16:27:59 UTC+1 Fritz Feldhase napisał(a):
    On Tuesday, November 28, 2023 at 3:56:17 PM UTC+1, Fritz Feldhase wrote:
    On Tuesday, November 28, 2023 at 7:43:16 AM UTC+1, FromTheRafters wrote:

    Neither are correct roster form set notation.

    Sure they are.
    You may check this, for example: https://proofwiki.org/wiki/Existence_of_Singleton_Set
    We (usually?) do NOT require a_i =/= a_j here for i,j e {1, ..., n}, i =/= j.
    For example:

    "_Curly bracket notation_

    We often define sets by listing their elements [...]:

    • The symbol {x, y, z} describes the set whose elements are precisely x, y, and z."

    You see, x = y = z = 1 (say) is not excluded.

    [Btw. A formal version of this definition would just be: x e {a, b, c} <-> x e a v x e b v x e c.]

    Source: https://math.mit.edu/~jhirsh/top_lecture.pdf

    "
    Sure they are.
    You may check this, for example: https://proofwiki.org/wiki/Existence_of_Singleton_Set
    "
    Proofs based on axioms :))
    It's really amusing.
    Axioms, unfortunately, being in it's important part internally contradictory, so flawed, in a way that cannot be questioned.

    To say that something is true or a correct description of reality just because an axiom says so, or it follows from an axiom,
    is exactly the same as saying that
    God exists because it follows from the content of the Roman Catholic Church catechism.

    Is it really so difficult to notice, to realize that using such methodologies of proving pushes you out from the realm of SCIENCE into the realm of an unscientific RELIGIOUS SECT?

    An axiom is not an argument, much less a proof or a basis for proof!

    Have a nice day.
    Regards,
    Adam

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Adam Polak@21:1/5 to All on Wed Nov 29 00:55:29 2023
    środa, 29 listopada 2023 o 09:26:50 UTC+1 Adam Polak napisał(a):
    wtorek, 28 listopada 2023 o 16:27:59 UTC+1 Fritz Feldhase napisał(a):
    On Tuesday, November 28, 2023 at 3:56:17 PM UTC+1, Fritz Feldhase wrote:
    On Tuesday, November 28, 2023 at 7:43:16 AM UTC+1, FromTheRafters wrote:

    Neither are correct roster form set notation.

    Sure they are.
    You may check this, for example: https://proofwiki.org/wiki/Existence_of_Singleton_Set
    We (usually?) do NOT require a_i =/= a_j here for i,j e {1, ..., n}, i =/= j.
    For example:

    "_Curly bracket notation_

    We often define sets by listing their elements [...]:

    • The symbol {x, y, z} describes the set whose elements are precisely x, y, and z."

    You see, x = y = z = 1 (say) is not excluded.

    [Btw. A formal version of this definition would just be: x e {a, b, c} <-> x e a v x e b v x e c.]

    Source: https://math.mit.edu/~jhirsh/top_lecture.pdf

    "
    Sure they are.
    You may check this, for example: https://proofwiki.org/wiki/Existence_of_Singleton_Set
    "
    Proofs based on axioms :))
    It's really amusing.
    Axioms, unfortunately, being in it's important part internally contradictory, so flawed, in a way that cannot be questioned.

    To say that something is true or a correct description of reality just because an axiom says so, or it follows from an axiom,
    is exactly the same as saying that
    God exists because it follows from the content of the Roman Catholic Church catechism.

    Is it really so difficult to notice, to realize that using such methodologies of proving pushes you out from the realm of SCIENCE into the realm of an unscientific RELIGIOUS SECT?

    An axiom is not an argument, much less a proof or a basis for proof!

    Have a nice day.
    Regards,
    Adam

    PS:
    To be clear, I am not questioning here the existence of God.
    As you can see, after all, thousands of years ago He predicted and described by inspired authors the emergence of the Set Theory Religion sect in the field of science:

    Romans 1:22
    Although they claimed to be wise, they became fools. (New International Version)
    Claiming to be wise, they instead became utter fools. (New Living Translation) :)

    Regards,
    Adam

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Fritz Feldhase@21:1/5 to Adam Polak on Wed Nov 29 00:59:11 2023
    On Wednesday, November 29, 2023 at 9:26:50 AM UTC+1, Adam Polak wrote:

    An axiom is not a basis for proof!

    That"s quite an interesting thought.

    On the other hand, in the context of /axiomatic set theory/ (say ZFC) it is. (Nomen est omen.)

    See: https://en.wikipedia.org/wiki/Zermelo%E2%80%93Fraenkel_set_theory1

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Fritz Feldhase@21:1/5 to Adam Polak on Wed Nov 29 01:19:30 2023
    On Wednesday, November 29, 2023 at 9:26:50 AM UTC+1, Adam Polak wrote:

    An axiom is not a basis for proof!

    That"s quite an interesting thought.

    On the other hand, in the context of /axiomatic set theory/ (say ZFC) it is. (Nomen est omen.)

    See: https://en.wikipedia.org/wiki/Zermelo%E2%80%93Fraenkel_set_theory

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Adam Polak@21:1/5 to All on Wed Nov 29 02:42:30 2023
    środa, 29 listopada 2023 o 11:21:19 UTC+1 Fritz Feldhase napisał(a):
    On Wednesday, November 29, 2023 at 9:26:50 AM UTC+1, Adam Polak wrote:
    Proofs based on axioms

    Since you seem to like this topic:

    http://de.metamath.org/

    Great site.
    thank U

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Fritz Feldhase@21:1/5 to Adam Polak on Wed Nov 29 02:21:12 2023
    On Wednesday, November 29, 2023 at 9:26:50 AM UTC+1, Adam Polak wrote:

    Proofs based on axioms

    Since you seem to like this topic:

    http://de.metamath.org/

    Great site.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to Adam Polak on Wed Nov 29 21:12:29 2023
    Adam Polak schrieb am Mittwoch, 29. November 2023 um 11:42:37 UTC+1:
    środa, 29 listopada 2023 o 11:21:19 UTC+1 Fritz Feldhase napisał(a):

    Hi Adam, unfortunately your post to "A game like billiards" of today
    does not appear in my news server. Therefore I answer it here:

    Adam Polak schrieb am Mittwoch, 29. November 2023 um 10:34:28 UTC+1:

    If the method involves STEP-by-STEP action, then the possibility of
    performing an action on "ALL" elements of an infinite series or set is
    excluded

    Counting is a step-by-step procedure. _If_ Cantor is accepted, then this procedure can be completed.

    the step-by-step method inherently requires minimal (delta t) one
    after one, in which subsequent steps are taken.

    By using the geometric series 1 + 1/2 + 1/4 + 1/8 + ... infinitely many
    steps can be processed within 2 seconds.

    The only type of action on the elements of an infinite series or set
    that can encompass "ALL" elements of such a series or set is an action involving "ALL" elements simultaneously.

    Mathematics is not time-dependent. If all steps are defined by the
    algorithm, and if infinitely many natural numbers can be applied at all,
    then this can be done like described in the OP. The only condition is
    that all steps are determined and no further decisions are necessary.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Adam Polak@21:1/5 to All on Wed Nov 29 21:30:24 2023
    środa, 29 listopada 2023 o 21:12:35 UTC+1 WM napisał(a):
    Adam Polak schrieb am Mittwoch, 29. November 2023 um 11:42:37 UTC+1:
    środa, 29 listopada 2023 o 11:21:19 UTC+1 Fritz Feldhase napisał(a):
    Hi Adam, unfortunately your post to "A game like billiards" of today
    does not appear in my news server. Therefore I answer it here:

    Adam Polak schrieb am Mittwoch, 29. November 2023 um 10:34:28 UTC+1:

    If the method involves STEP-by-STEP action, then the possibility of performing an action on "ALL" elements of an infinite series or set is excluded

    Counting (one by one) the elements of an infinite set can never be brought to completion because it would inevitably involve necesity of finding an element in the infinite set that does not have a successor - and such an element, by definition, does not
    exist in an infinite set.
    So, it's simply ruled out.

    Counting is a step-by-step procedure. _If_ Cantor is accepted, then this procedure can be completed.

    the step-by-step method inherently requires minimal (delta t) one
    after one, in which subsequent steps are taken.

    By using the geometric series 1 + 1/2 + 1/4 + 1/8 + ... infinitely many steps can be processed within 2 seconds.

    Yes, but only as an "AT ONCE" operation, never as a "STEP by STEP" operation.

    The only type of action on the elements of an infinite series or set
    that can encompass "ALL" elements of such a series or set is an action involving "ALL" elements simultaneously.

    Mathematics is not time-dependent. If all steps are defined by the algorithm, and if infinitely many natural numbers can be applied at all, then this can be done like described in the OP. The only condition is
    that all steps are determined and no further decisions are necessary.


    If you define the operation as "STEP by STEP," it takes place in time - thats reality,
    regardless of what you may think about it or say.

    "STEP by STEP" means one AFTER another, forcing the existence of minimal time units one after another, in which successive operations, successive steps, take place.

    Regards,
    Adam

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to Adam Polak on Tue Dec 5 19:04:10 2023
    Adam Polak schrieb am Dienstag, 5. Dezember 2023 um 11:09:24 UTC+1:
    wtorek, 5 grudnia 2023 o 10:42:52 UTC+1 WM napisał(a):

    If I could suggest anything to anyone: Don't waste too much time
    considering bijection.

    I only show that Cantor's alleged bijection is none. Because I copy
    Cantor's procedure precisely. The only difference is that
    I take the indices from the first column. If this destroyed the effect,
    then there would be no bijection n <--> 1/n. Hence Cantor has failed.

    A necessary condition for a bijection between the elements of an
    infinite set and the elements of its proper subset is that the chosen
    proper subset must also be an infinite set.

    The "bijections" simply show that only potentially infinite sets are
    applied. If actually infinite sets exist, then we for instance more
    fractions than natural numbers. The X in

    XOOO...
    XOOO...
    XOOO...
    XOOO...
    ...

    will never cover the whole matrix. But they can cover the upper left
    corner so far that naive observers believe the whole matrix was covered.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Phil Carmody@21:1/5 to FromTheRafters on Wed Dec 6 09:47:44 2023
    FromTheRafters <FTR@nomail.afraid.org> writes:
    Adam Polak wrote on 11/24/2023 :
    piątek, 24 listopada 2023 o 08:25:12 UTC+1 FromTheRafters napisał(a):
    "
    Set: { 1, 3, 4/4, 18 } how many elements contain ?
    Four symbols separated by three commas. I would say four elements.
    Cardinality four.
    "
    what happened that you didn't recognize 4/4 as 1 as "the number ONE"

    I didn't recognize that collection as a set, but as a multiset,
    because ZFC sets don't have duplicate elements.

    and that, in accordance with Set theory, you did not answer: three elements ?
    just think it over

    Yes, you are correct. I should have because the symbol 4/4 and the
    symbol 1 are the same number just like 1/2 and .5 and .4(9) are all
    the same number.

    If the subject is sets, I really couldn't countainance { 1, 4/4, 1.0 }
    as being anything apart from a perfectly valid 3-element set containing
    a natural number, a distinct rational, and a distinct real
    number. Representation matters, not value across canonicalisations
    thereof.

    Phil
    --
    We are no longer hunters and nomads. No longer awed and frightened, as we have gained some understanding of the world in which we live. As such, we can cast aside childish remnants from the dawn of our civilization.
    -- NotSanguine on SoylentNews, after Eugen Weber in /The Western Tradition/

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)