• Re: have we been misusing incompleteness???

    From pa@pa@see.signature.invalid (Pierre Asselin) to comp.theory,sci.logic,sci.math,comp.ai.philosophy on Wed Dec 31 21:16:39 2025
    From Newsgroup: comp.ai.philosophy

    In sci.logic Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> wrote:

    [ ... ]
    Then he defines a new system "P" which he uses to get even more muddled, leaves out the crucial elements of his proof because it's too easy to
    get wrong,

    Gödel, muddled? He was the most meticulous sonovabitch that ever
    lived!


    and Stephen Meyer says he does get it wrong; he seems to be
    the only person in the world that ever checked.

    People have misunderstood Gödel and proved it by their comments.
    I don't know who Stephen Meyer is; my money is on Gödel.
    --
    pa at panix dot com
    --- Synchronet 3.21a-Linux NewsLink 1.2
  • From Richard Damon@Richard@Damon-Family.org to comp.theory,sci.logic,sci.math,comp.ai.philosophy on Wed Dec 31 16:21:50 2025
    From Newsgroup: comp.ai.philosophy

    On 12/29/25 3:20 PM, Tristan Wibberley wrote:
    On 29/12/2025 19:53, Richard Damon wrote:
    On 12/29/25 2:32 PM, olcott wrote:
    On 12/29/2025 1:21 PM, Pierre Asselin wrote:
    In sci.logic Tristan Wibberley
    <tristan.wibberley+netnews2@alumni.manchester.ac.uk> wrote:
    On 29/12/2025 13:37, Richard Damon wrote:

    Incompleteness is a property of a given Formal System, it says that >>>>>> there exist a statement that is true in that system, but can not be >>>>>> proven in that system.

    What do you mean by "proven" here. Do you mean "derived" ?

    I think Richard misspoke slightly. The undecidable statement is
    true *in the intended interpretation* of the formal system
    (In Goedel's case, the natural numbers with addition and
    multiplication).

    Truth "in the formal system" isn't really defined. You need an
    interpretation.


    Unless (as I have been saying for at least a decade)
    the formal language directly encodes all of its
    semantics directly in its syntax. The Montague
    Grammar of natural language semantics is the best
    known example of this.


    But it can't, as any system that defines symbols, can have something
    outside it assign additional meaning to those symbols.

    Ontology suggests ways to *apply* a system. The system itself works
    without additional meaning just as it does with. That's the point of
    formal systems.

    There may be SOME meaning within the system, but, with a sufficiently
    expressive system, additional meaning can be imposed.

    additional meaning is given to an embedding or extension (which is pretty-much a special-case of embedding) of a system, not to the system itself.

    In the case of Gödel's preamble, he defines an extension of PM (I should suppose he was using 2nd ed. in 1931 from his untruths about PM if
    applied to 1st. ed.) That extension is inconsistent (or, better, I
    think, indiscriminate). his referent there for PM slides between PM and
    the derived system as he writes and he gets muddled taking a half-formed conclusion about one, assuming and completing it for the other.

    Then he defines a new system "P" which he uses to get even more muddled, leaves out the crucial elements of his proof because it's too easy to
    get wrong, and Stephen Meyer says he does get it wrong; he seems to be
    the only person in the world that ever checked.


    I would suggest, if you find an actual ERROR in what he said, that you
    can prove, you write a paper and publish it to make a name for yourself.

    Of course, if you show that your error is you don't actually understand
    what you claim to be talking about, you will make the fool of yourself.
    --- Synchronet 3.21a-Linux NewsLink 1.2
  • From olcott@polcott333@gmail.com to comp.theory,sci.logic,sci.math,comp.ai.philosophy on Wed Dec 31 15:52:46 2025
    From Newsgroup: comp.ai.philosophy

    On 12/31/2025 3:16 PM, Pierre Asselin wrote:
    In sci.logic Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> wrote:

    [ ... ]
    Then he defines a new system "P" which he uses to get even more muddled,
    leaves out the crucial elements of his proof because it's too easy to
    get wrong,

    Gödel, muddled? He was the most meticulous sonovabitch that ever
    lived!


    and Stephen Meyer says he does get it wrong; he seems to be
    the only person in the world that ever checked.

    People have misunderstood Gödel and proved it by their comments.
    I don't know who Stephen Meyer is; my money is on Gödel.


    Gödel proved that there cannot possibly exist any
    sequence of inference steps in F prove that they
    themselves do not exist.

    He admitted this himself:
    ...We are therefore confronted with a proposition
    which asserts its own unprovability. 15 … (Gödel 1931:40-41)

    Gödel, Kurt 1931.
    On Formally Undecidable Propositions of
    Principia Mathematica And Related Systems
    --
    Copyright 2025 Olcott<br><br>

    My 28 year goal has been to make <br>
    "true on the basis of meaning expressed in language"<br>
    reliably computable.<br><br>

    This required establishing a new foundation<br>
    --- Synchronet 3.21a-Linux NewsLink 1.2
  • From Richard Damon@Richard@Damon-Family.org to comp.theory,sci.logic,sci.math,comp.ai.philosophy on Wed Dec 31 16:56:12 2025
    From Newsgroup: comp.ai.philosophy

    On 12/31/25 4:52 PM, olcott wrote:
    On 12/31/2025 3:16 PM, Pierre Asselin wrote:
    In sci.logic Tristan Wibberley
    <tristan.wibberley+netnews2@alumni.manchester.ac.uk> wrote:

    [ ... ]
    Then he defines a new system "P" which he uses to get even more muddled, >>> leaves out the crucial elements of his proof because it's too easy to
    get wrong,

    Gödel, muddled? He was the most meticulous sonovabitch that ever
    lived!


    and Stephen Meyer says he does get it wrong; he seems to be
    the only person in the world that ever checked.

    People have misunderstood Gödel and proved it by their comments.
    I don't know who Stephen Meyer is; my money is on Gödel.


    Gödel proved that there cannot possibly exist any
    sequence of inference steps in F prove that they
    themselves do not exist.

    No *FINITE* sequence of inference steps.

    He also proves there *IS* an infinite sequence of steps


    He admitted this himself:
    ...We are therefore confronted with a proposition
    which asserts its own unprovability. 15 … (Gödel 1931:40-41)

    And proofs are finite.

    And that statement is made in the Meta System, and is talking about the
    base system.

    All you are doing is proving that you are an idiot, and maybe in your
    case there isn't a difference between You and a deterministic machine,
    as you are stuck in your bad programming.

    It seems you hae a broken CPU.


    Gödel, Kurt 1931.
    On Formally Undecidable Propositions of
    Principia Mathematica And Related Systems



    --- Synchronet 3.21a-Linux NewsLink 1.2
  • From olcott@polcott333@gmail.com to comp.theory,sci.logic,sci.math,comp.ai.philosophy on Wed Dec 31 15:57:58 2025
    From Newsgroup: comp.ai.philosophy

    On 12/29/2025 2:20 PM, Tristan Wibberley wrote:
    On 29/12/2025 19:53, Richard Damon wrote:
    On 12/29/25 2:32 PM, olcott wrote:
    On 12/29/2025 1:21 PM, Pierre Asselin wrote:
    In sci.logic Tristan Wibberley
    <tristan.wibberley+netnews2@alumni.manchester.ac.uk> wrote:
    On 29/12/2025 13:37, Richard Damon wrote:

    Incompleteness is a property of a given Formal System, it says that >>>>>> there exist a statement that is true in that system, but can not be >>>>>> proven in that system.

    What do you mean by "proven" here. Do you mean "derived" ?

    I think Richard misspoke slightly. The undecidable statement is
    true *in the intended interpretation* of the formal system
    (In Goedel's case, the natural numbers with addition and
    multiplication).

    Truth "in the formal system" isn't really defined. You need an
    interpretation.


    Unless (as I have been saying for at least a decade)
    the formal language directly encodes all of its
    semantics directly in its syntax. The Montague
    Grammar of natural language semantics is the best
    known example of this.


    But it can't, as any system that defines symbols, can have something
    outside it assign additional meaning to those symbols.

    Ontology suggests ways to *apply* a system. The system itself works
    without additional meaning just as it does with. That's the point of
    formal systems.

    There may be SOME meaning within the system, but, with a sufficiently
    expressive system, additional meaning can be imposed.

    additional meaning is given to an embedding or extension (which is pretty-much a special-case of embedding) of a system, not to the system itself.

    In the case of Gödel's preamble, he defines an extension of PM (I should suppose he was using 2nd ed. in 1931 from his untruths about PM if
    applied to 1st. ed.) That extension is inconsistent (or, better, I
    think, indiscriminate). his referent there for PM slides between PM and
    the derived system as he writes and he gets muddled taking a half-formed conclusion about one, assuming and completing it for the other.

    Then he defines a new system "P" which he uses to get even more muddled, leaves out the crucial elements of his proof because it's too easy to
    get wrong, and Stephen Meyer says he does get it wrong; he seems to be
    the only person in the world that ever checked.


    Gödel proved that there cannot possibly exist any
    sequence of inference steps in F prove that they
    themselves do not exist.

    He admitted this himself:
    ...We are therefore confronted with a proposition
    which asserts its own unprovability. 15 … (Gödel 1931:40-41)

    Gödel, Kurt 1931.
    On Formally Undecidable Propositions of
    Principia Mathematica And Related Systems
    --
    Copyright 2025 Olcott<br><br>

    My 28 year goal has been to make <br>
    "true on the basis of meaning expressed in language"<br>
    reliably computable.<br><br>

    This required establishing a new foundation<br>
    --- Synchronet 3.21a-Linux NewsLink 1.2
  • From olcott@polcott333@gmail.com to comp.theory,sci.logic,sci.math,comp.ai.philosophy on Wed Dec 31 15:59:24 2025
    From Newsgroup: comp.ai.philosophy

    On 12/31/2025 3:56 PM, Richard Damon wrote:
    On 12/31/25 4:52 PM, olcott wrote:
    On 12/31/2025 3:16 PM, Pierre Asselin wrote:
    In sci.logic Tristan Wibberley
    <tristan.wibberley+netnews2@alumni.manchester.ac.uk> wrote:

    [ ... ]
    Then he defines a new system "P" which he uses to get even more
    muddled,
    leaves out the crucial elements of his proof because it's too easy to
    get wrong,

    Gödel, muddled? He was the most meticulous sonovabitch that ever
    lived!


    and Stephen Meyer says he does get it wrong; he seems to be
    the only person in the world that ever checked.

    People have misunderstood Gödel and proved it by their comments.
    I don't know who Stephen Meyer is; my money is on Gödel.


    Gödel proved that there cannot possibly exist any
    sequence of inference steps in F prove that they
    themselves do not exist.

    No *FINITE* sequence of inference steps.


    Nothing can prove that itself does not
    exist because that forms proof that it
    does exist, dumbo.

    He also proves there *IS* an infinite sequence of steps


    He admitted this himself:
    ...We are therefore confronted with a proposition
    which asserts its own unprovability. 15 … (Gödel 1931:40-41)

    And proofs are finite.

    And that statement is made in the Meta System, and is talking about the
    base system.

    All you are doing is proving that you are an idiot, and maybe in your
    case there isn't a difference between You and a deterministic machine,
    as you are stuck in your bad programming.

    It seems you hae a broken CPU.


    Gödel, Kurt 1931.
    On Formally Undecidable Propositions of
    Principia Mathematica And Related Systems



    --
    Copyright 2025 Olcott<br><br>

    My 28 year goal has been to make <br>
    "true on the basis of meaning expressed in language"<br>
    reliably computable.<br><br>

    This required establishing a new foundation<br>
    --- Synchronet 3.21a-Linux NewsLink 1.2
  • From Richard Damon@Richard@Damon-Family.org to comp.theory,sci.logic,sci.math,comp.ai.philosophy on Wed Dec 31 17:01:57 2025
    From Newsgroup: comp.ai.philosophy

    On 12/31/25 4:57 PM, olcott wrote:
    On 12/29/2025 2:20 PM, Tristan Wibberley wrote:
    On 29/12/2025 19:53, Richard Damon wrote:
    On 12/29/25 2:32 PM, olcott wrote:
    On 12/29/2025 1:21 PM, Pierre Asselin wrote:
    In sci.logic Tristan Wibberley
    <tristan.wibberley+netnews2@alumni.manchester.ac.uk> wrote:
    On 29/12/2025 13:37, Richard Damon wrote:

    Incompleteness is a property of a given Formal System, it says that >>>>>>> there exist a statement that is true in that system, but can not be >>>>>>> proven in that system.

    What do you mean by "proven" here. Do you mean "derived" ?

    I think Richard misspoke slightly. The undecidable statement is
    true *in the intended interpretation* of the formal system
    (In Goedel's case, the natural numbers with addition and
    multiplication).

    Truth "in the formal system" isn't really defined. You need an
    interpretation.


    Unless (as I have been saying for at least a decade)
    the formal language directly encodes all of its
    semantics directly in its syntax. The Montague
    Grammar of natural language semantics is the best
    known example of this.


    But it can't, as any system that defines symbols, can have something
    outside it assign additional meaning to those symbols.

    Ontology suggests ways to *apply* a system. The system itself works
    without additional meaning just as it does with. That's the point of
    formal systems.

    There may be SOME meaning within the system, but, with a sufficiently
    expressive system, additional meaning can be imposed.

    additional meaning is given to an embedding or extension (which is
    pretty-much a special-case of embedding) of a system, not to the system
    itself.

    In the case of Gödel's preamble, he defines an extension of PM (I should
    suppose he was using 2nd ed. in 1931 from his untruths about PM if
    applied to 1st. ed.) That extension is inconsistent (or, better, I
    think, indiscriminate). his referent there for PM slides between PM and
    the derived system as he writes and he gets muddled taking a half-formed
    conclusion about one, assuming and completing it for the other.

    Then he defines a new system "P" which he uses to get even more muddled,
    leaves out the crucial elements of his proof because it's too easy to
    get wrong, and Stephen Meyer says he does get it wrong; he seems to be
    the only person in the world that ever checked.


    Gödel proved that there cannot possibly exist any
    sequence of inference steps in F prove that they
    themselves do not exist.

    No *FINITE* sequence, as that is what a proof is.

    He also proved the existance of the INFINITE sequence that made the
    statement true.


    He admitted this himself:
    ...We are therefore confronted with a proposition
    which asserts its own unprovability. 15 … (Gödel 1931:40-41)

    Which you don't understand,

    This is an interpreation of the statement in the meta system that is
    talking about its provability in the base system.

    So yes, the statement is TRUE and unprovable.

    If it was FALSE, then that says we can prove a false statement to be
    true, which is just a contradiction.

    Of course, you are just showing your stupidity and inability to
    understand things,

    It sounds like you have burnt out your CPU and lost the ability to
    think, and are stuck in a trap loop.


    Gödel, Kurt 1931.
    On Formally Undecidable Propositions of
    Principia Mathematica And Related Systems



    --- Synchronet 3.21a-Linux NewsLink 1.2
  • From Richard Damon@Richard@Damon-Family.org to comp.theory,sci.logic,sci.math,comp.ai.philosophy on Wed Dec 31 17:09:17 2025
    From Newsgroup: comp.ai.philosophy

    On 12/31/25 4:59 PM, olcott wrote:
    On 12/31/2025 3:56 PM, Richard Damon wrote:
    On 12/31/25 4:52 PM, olcott wrote:
    On 12/31/2025 3:16 PM, Pierre Asselin wrote:
    In sci.logic Tristan Wibberley
    <tristan.wibberley+netnews2@alumni.manchester.ac.uk> wrote:

    [ ... ]
    Then he defines a new system "P" which he uses to get even more
    muddled,
    leaves out the crucial elements of his proof because it's too easy to >>>>> get wrong,

    Gödel, muddled? He was the most meticulous sonovabitch that ever
    lived!


    and Stephen Meyer says he does get it wrong; he seems to be
    the only person in the world that ever checked.

    People have misunderstood Gödel and proved it by their comments.
    I don't know who Stephen Meyer is; my money is on Gödel.


    Gödel proved that there cannot possibly exist any
    sequence of inference steps in F prove that they
    themselves do not exist.

    No *FINITE* sequence of inference steps.


    Nothing can prove that itself does not
    exist because that forms proof that it
    does exist, dumbo.

    So you are just ignoring context because you are stupid.

    The statement, with the added information of the meta-system proves (by
    a proof in the meta system) that the statment is true.

    Because, the statement is just a statement of arithmatic in the base
    system, that means it is also must be true in the base system.

    A result of the statement being true, it shows (with its interpreation
    in the meta system) that there can not be a proof in the base system for it,

    So, all you are doing is saying you can't tell the difference between different system and think they are all the same.

    That is like saying your cat can be a dog.

    You really are THAT stupid.

    So
    G + Meta proves G
    G without Meta can't prove G

    No contradiction, as Meta provides the information that allows the proof
    to be formed.


    He also proves there *IS* an infinite sequence of steps


    He admitted this himself:
    ...We are therefore confronted with a proposition
    which asserts its own unprovability. 15 … (Gödel 1931:40-41)

    And proofs are finite.

    And that statement is made in the Meta System, and is talking about
    the base system.

    All you are doing is proving that you are an idiot, and maybe in your
    case there isn't a difference between You and a deterministic machine,
    as you are stuck in your bad programming.

    It seems you hae a broken CPU.


    Gödel, Kurt 1931.
    On Formally Undecidable Propositions of
    Principia Mathematica And Related Systems






    --- Synchronet 3.21a-Linux NewsLink 1.2
  • From olcott@polcott333@gmail.com to comp.theory,sci.logic,sci.math,comp.ai.philosophy on Wed Dec 31 16:42:43 2025
    From Newsgroup: comp.ai.philosophy

    On 12/31/2025 4:09 PM, Richard Damon wrote:
    On 12/31/25 4:59 PM, olcott wrote:
    On 12/31/2025 3:56 PM, Richard Damon wrote:
    On 12/31/25 4:52 PM, olcott wrote:
    On 12/31/2025 3:16 PM, Pierre Asselin wrote:
    In sci.logic Tristan Wibberley
    <tristan.wibberley+netnews2@alumni.manchester.ac.uk> wrote:

    [ ... ]
    Then he defines a new system "P" which he uses to get even more
    muddled,
    leaves out the crucial elements of his proof because it's too easy to >>>>>> get wrong,

    Gödel, muddled? He was the most meticulous sonovabitch that ever
    lived!


    and Stephen Meyer says he does get it wrong; he seems to be
    the only person in the world that ever checked.

    People have misunderstood Gödel and proved it by their comments.
    I don't know who Stephen Meyer is; my money is on Gödel.


    Gödel proved that there cannot possibly exist any
    sequence of inference steps in F prove that they
    themselves do not exist.

    No *FINITE* sequence of inference steps.


    Nothing can prove that itself does not
    exist because that forms proof that it
    does exist, dumbo.

    So you are just ignoring context because you are stupid.

    The statement, with the added information of the meta-system proves (by
    a proof in the meta system) that the statment is true.


    Something else can prove that X cannot prove that
    X does not exist, AKA your meta-system.

    Nothing can directly prove that itself does not
    exist because this forms proof that it does exist.
    --
    Copyright 2025 Olcott<br><br>

    My 28 year goal has been to make <br>
    "true on the basis of meaning expressed in language"<br>
    reliably computable.<br><br>

    This required establishing a new foundation<br>
    --- Synchronet 3.21a-Linux NewsLink 1.2
  • From Richard Damon@Richard@Damon-Family.org to comp.theory,sci.logic,sci.math,comp.ai.philosophy on Wed Dec 31 17:48:36 2025
    From Newsgroup: comp.ai.philosophy

    On 12/31/25 5:42 PM, olcott wrote:
    On 12/31/2025 4:09 PM, Richard Damon wrote:
    On 12/31/25 4:59 PM, olcott wrote:
    On 12/31/2025 3:56 PM, Richard Damon wrote:
    On 12/31/25 4:52 PM, olcott wrote:
    On 12/31/2025 3:16 PM, Pierre Asselin wrote:
    In sci.logic Tristan Wibberley
    <tristan.wibberley+netnews2@alumni.manchester.ac.uk> wrote:

    [ ... ]
    Then he defines a new system "P" which he uses to get even more >>>>>>> muddled,
    leaves out the crucial elements of his proof because it's too
    easy to
    get wrong,

    Gödel, muddled? He was the most meticulous sonovabitch that ever
    lived!


    and Stephen Meyer says he does get it wrong; he seems to be
    the only person in the world that ever checked.

    People have misunderstood Gödel and proved it by their comments.
    I don't know who Stephen Meyer is; my money is on Gödel.


    Gödel proved that there cannot possibly exist any
    sequence of inference steps in F prove that they
    themselves do not exist.

    No *FINITE* sequence of inference steps.


    Nothing can prove that itself does not
    exist because that forms proof that it
    does exist, dumbo.

    So you are just ignoring context because you are stupid.

    The statement, with the added information of the meta-system proves
    (by a proof in the meta system) that the statment is true.


    Something else can prove that X cannot prove that
    X does not exist, AKA your meta-system.

    Nothing can directly prove that itself does not
    exist because this forms proof that it does exist.



    Nope, got a source for that?

    Why does my explanation not work?

    Can you even put my explaination imto your own words to show that you understand it.

    The statement G, under the interpreation provided by M certainly can
    prove that the system without M can't prove it.

    It seems you think that X is as big as X+1

    Sorry, you are just showing that you brain has self-distructed itself
    and left you with no ability to reason.
    --- Synchronet 3.21a-Linux NewsLink 1.2
  • From olcott@polcott333@gmail.com to comp.theory,sci.logic,sci.math,comp.ai.philosophy on Wed Dec 31 17:08:00 2025
    From Newsgroup: comp.ai.philosophy

    On 12/31/2025 4:48 PM, Richard Damon wrote:
    On 12/31/25 5:42 PM, olcott wrote:
    On 12/31/2025 4:09 PM, Richard Damon wrote:
    On 12/31/25 4:59 PM, olcott wrote:
    On 12/31/2025 3:56 PM, Richard Damon wrote:
    On 12/31/25 4:52 PM, olcott wrote:
    On 12/31/2025 3:16 PM, Pierre Asselin wrote:
    In sci.logic Tristan Wibberley
    <tristan.wibberley+netnews2@alumni.manchester.ac.uk> wrote:

    [ ... ]
    Then he defines a new system "P" which he uses to get even more >>>>>>>> muddled,
    leaves out the crucial elements of his proof because it's too >>>>>>>> easy to
    get wrong,

    Gödel, muddled? He was the most meticulous sonovabitch that ever >>>>>>> lived!


    and Stephen Meyer says he does get it wrong; he seems to be
    the only person in the world that ever checked.

    People have misunderstood Gödel and proved it by their comments. >>>>>>> I don't know who Stephen Meyer is; my money is on Gödel.


    Gödel proved that there cannot possibly exist any
    sequence of inference steps in F prove that they
    themselves do not exist.

    No *FINITE* sequence of inference steps.


    Nothing can prove that itself does not
    exist because that forms proof that it
    does exist, dumbo.

    So you are just ignoring context because you are stupid.

    The statement, with the added information of the meta-system proves
    (by a proof in the meta system) that the statment is true.


    Something else can prove that X cannot prove that
    X does not exist, AKA your meta-system.

    Nothing can directly prove that itself does not
    exist because this forms proof that it does exist.



    Nope, got a source for that?

    Why does my explanation not work?


    It is not that your explanation doesn't work.
    It is that it ignores the root cause of why
    G is unprovable in F.

    If you disagree then provide a correct
    proof that you yourself never existed.

    If you can't see how this is impossible
    you must by very dumb.

    Since you have proved that you are quite
    smart then any disagreement would most
    likely be a lie, a mere head game.

    Can you even put my explaination imto your own words to show that you understand it.

    The statement G, under the interpreation provided by M certainly can
    prove that the system without M can't prove it.

    It seems you think that X is as big as X+1

    Sorry, you are just showing that you brain has self-distructed itself
    and left you with no ability to reason.
    --
    Copyright 2025 Olcott<br><br>

    My 28 year goal has been to make <br>
    "true on the basis of meaning expressed in language"<br>
    reliably computable.<br><br>

    This required establishing a new foundation<br>
    --- Synchronet 3.21a-Linux NewsLink 1.2
  • From Richard Damon@Richard@Damon-Family.org to comp.theory,sci.logic,sci.math,comp.ai.philosophy on Wed Dec 31 18:27:03 2025
    From Newsgroup: comp.ai.philosophy

    On 12/31/25 6:08 PM, olcott wrote:
    On 12/31/2025 4:48 PM, Richard Damon wrote:
    On 12/31/25 5:42 PM, olcott wrote:
    On 12/31/2025 4:09 PM, Richard Damon wrote:
    On 12/31/25 4:59 PM, olcott wrote:
    On 12/31/2025 3:56 PM, Richard Damon wrote:
    On 12/31/25 4:52 PM, olcott wrote:
    On 12/31/2025 3:16 PM, Pierre Asselin wrote:
    In sci.logic Tristan Wibberley
    <tristan.wibberley+netnews2@alumni.manchester.ac.uk> wrote:

    [ ... ]
    Then he defines a new system "P" which he uses to get even more >>>>>>>>> muddled,
    leaves out the crucial elements of his proof because it's too >>>>>>>>> easy to
    get wrong,

    Gödel, muddled? He was the most meticulous sonovabitch that ever >>>>>>>> lived!


    and Stephen Meyer says he does get it wrong; he seems to be
    the only person in the world that ever checked.

    People have misunderstood Gödel and proved it by their comments. >>>>>>>> I don't know who Stephen Meyer is; my money is on Gödel.


    Gödel proved that there cannot possibly exist any
    sequence of inference steps in F prove that they
    themselves do not exist.

    No *FINITE* sequence of inference steps.


    Nothing can prove that itself does not
    exist because that forms proof that it
    does exist, dumbo.

    So you are just ignoring context because you are stupid.

    The statement, with the added information of the meta-system proves
    (by a proof in the meta system) that the statment is true.


    Something else can prove that X cannot prove that
    X does not exist, AKA your meta-system.

    Nothing can directly prove that itself does not
    exist because this forms proof that it does exist.



    Nope, got a source for that?

    Why does my explanation not work?


    It is not that your explanation doesn't work.
    It is that it ignores the root cause of why
    G is unprovable in F.

    So, how do you think you can prove it in F?


    If you disagree then provide a correct
    proof that you yourself never existed.

    Not the same.

    You are ignoring the effect of different context.

    And, since I exist, I can't prove a false statement that I don't exist.

    Also, G isn't the proof, it is the thing being proven or not.


    If you can't see how this is impossible
    you must by very dumb.

    Your arguement is just stupid, and invalid.

    Showing that likely you are both STUPID yourself, and a liar.


    Since you have proved that you are quite
    smart then any disagreement would most
    likely be a lie, a mere head game.

    Why? How is it a lie to disagree with a falsehood?

    You just continue to prove that you are nothing but a totally ignorant pathological liar that just doesn't understand logic, but doesn't care.


    Can you even put my explaination imto your own words to show that you
    understand it.

    The statement G, under the interpreation provided by M certainly can
    prove that the system without M can't prove it.

    It seems you think that X is as big as X+1

    Sorry, you are just showing that you brain has self-distructed itself
    and left you with no ability to reason.



    --- Synchronet 3.21a-Linux NewsLink 1.2
  • From olcott@polcott333@gmail.com to comp.theory,sci.logic,sci.math,comp.ai.philosophy on Wed Dec 31 18:23:03 2025
    From Newsgroup: comp.ai.philosophy

    On 12/31/2025 5:27 PM, Richard Damon wrote:
    On 12/31/25 6:08 PM, olcott wrote:
    On 12/31/2025 4:48 PM, Richard Damon wrote:
    On 12/31/25 5:42 PM, olcott wrote:
    On 12/31/2025 4:09 PM, Richard Damon wrote:
    On 12/31/25 4:59 PM, olcott wrote:
    On 12/31/2025 3:56 PM, Richard Damon wrote:
    On 12/31/25 4:52 PM, olcott wrote:
    On 12/31/2025 3:16 PM, Pierre Asselin wrote:
    In sci.logic Tristan Wibberley
    <tristan.wibberley+netnews2@alumni.manchester.ac.uk> wrote:

    [ ... ]
    Then he defines a new system "P" which he uses to get even >>>>>>>>>> more muddled,
    leaves out the crucial elements of his proof because it's too >>>>>>>>>> easy to
    get wrong,

    Gödel, muddled? He was the most meticulous sonovabitch that ever >>>>>>>>> lived!


    and Stephen Meyer says he does get it wrong; he seems to be >>>>>>>>>> the only person in the world that ever checked.

    People have misunderstood Gödel and proved it by their comments. >>>>>>>>> I don't know who Stephen Meyer is; my money is on Gödel.


    Gödel proved that there cannot possibly exist any
    sequence of inference steps in F prove that they
    themselves do not exist.

    No *FINITE* sequence of inference steps.


    Nothing can prove that itself does not
    exist because that forms proof that it
    does exist, dumbo.

    So you are just ignoring context because you are stupid.

    The statement, with the added information of the meta-system proves >>>>> (by a proof in the meta system) that the statment is true.


    Something else can prove that X cannot prove that
    X does not exist, AKA your meta-system.

    Nothing can directly prove that itself does not
    exist because this forms proof that it does exist.



    Nope, got a source for that?

    Why does my explanation not work?


    It is not that your explanation doesn't work.
    It is that it ignores the root cause of why
    G is unprovable in F.

    So, how do you think you can prove it in F?


    Nothing can prove that itself does not exist.
    Any such proof would be self-refuting.
    --
    Copyright 2025 Olcott<br><br>

    My 28 year goal has been to make <br>
    "true on the basis of meaning expressed in language"<br>
    reliably computable.<br><br>

    This required establishing a new foundation<br>
    --- Synchronet 3.21a-Linux NewsLink 1.2
  • From Richard Damon@Richard@Damon-Family.org to comp.theory,sci.logic,sci.math,comp.ai.philosophy on Wed Dec 31 19:35:47 2025
    From Newsgroup: comp.ai.philosophy

    On 12/31/25 7:23 PM, olcott wrote:
    On 12/31/2025 5:27 PM, Richard Damon wrote:
    On 12/31/25 6:08 PM, olcott wrote:
    On 12/31/2025 4:48 PM, Richard Damon wrote:
    On 12/31/25 5:42 PM, olcott wrote:
    On 12/31/2025 4:09 PM, Richard Damon wrote:
    On 12/31/25 4:59 PM, olcott wrote:
    On 12/31/2025 3:56 PM, Richard Damon wrote:
    On 12/31/25 4:52 PM, olcott wrote:
    On 12/31/2025 3:16 PM, Pierre Asselin wrote:
    In sci.logic Tristan Wibberley
    <tristan.wibberley+netnews2@alumni.manchester.ac.uk> wrote: >>>>>>>>>>
    [ ... ]
    Then he defines a new system "P" which he uses to get even >>>>>>>>>>> more muddled,
    leaves out the crucial elements of his proof because it's too >>>>>>>>>>> easy to
    get wrong,

    Gödel, muddled? He was the most meticulous sonovabitch that ever >>>>>>>>>> lived!


    and Stephen Meyer says he does get it wrong; he seems to be >>>>>>>>>>> the only person in the world that ever checked.

    People have misunderstood Gödel and proved it by their comments. >>>>>>>>>> I don't know who Stephen Meyer is; my money is on Gödel.


    Gödel proved that there cannot possibly exist any
    sequence of inference steps in F prove that they
    themselves do not exist.

    No *FINITE* sequence of inference steps.


    Nothing can prove that itself does not
    exist because that forms proof that it
    does exist, dumbo.

    So you are just ignoring context because you are stupid.

    The statement, with the added information of the meta-system
    proves (by a proof in the meta system) that the statment is true.


    Something else can prove that X cannot prove that
    X does not exist, AKA your meta-system.

    Nothing can directly prove that itself does not
    exist because this forms proof that it does exist.



    Nope, got a source for that?

    Why does my explanation not work?


    It is not that your explanation doesn't work.
    It is that it ignores the root cause of why
    G is unprovable in F.

    So, how do you think you can prove it in F?


    Nothing can prove that itself does not exist.
    Any such proof would be self-refuting.


    But it isn't the PROOF that does the proving, it is the statement.

    THe statement G exist, and it is True.

    Because it is true, and can be proven with the additional knowledge and
    tools of the meta-system, it shows that without the addtional knowledge
    and tools you can't make the proof.

    It seems you don't understand that the base system and the meta system
    are different.

    Boy, are you stupid.
    --- Synchronet 3.21a-Linux NewsLink 1.2
  • From olcott@polcott333@gmail.com to comp.theory,sci.logic,sci.math,comp.ai.philosophy on Wed Dec 31 19:04:07 2025
    From Newsgroup: comp.ai.philosophy

    On 12/31/2025 6:35 PM, Richard Damon wrote:
    On 12/31/25 7:23 PM, olcott wrote:
    On 12/31/2025 5:27 PM, Richard Damon wrote:
    On 12/31/25 6:08 PM, olcott wrote:
    On 12/31/2025 4:48 PM, Richard Damon wrote:
    On 12/31/25 5:42 PM, olcott wrote:
    On 12/31/2025 4:09 PM, Richard Damon wrote:
    On 12/31/25 4:59 PM, olcott wrote:
    On 12/31/2025 3:56 PM, Richard Damon wrote:
    On 12/31/25 4:52 PM, olcott wrote:
    On 12/31/2025 3:16 PM, Pierre Asselin wrote:
    In sci.logic Tristan Wibberley
    <tristan.wibberley+netnews2@alumni.manchester.ac.uk> wrote: >>>>>>>>>>>
    [ ... ]
    Then he defines a new system "P" which he uses to get even >>>>>>>>>>>> more muddled,
    leaves out the crucial elements of his proof because it's >>>>>>>>>>>> too easy to
    get wrong,

    Gödel, muddled? He was the most meticulous sonovabitch that ever >>>>>>>>>>> lived!


    and Stephen Meyer says he does get it wrong; he seems to be >>>>>>>>>>>> the only person in the world that ever checked.

    People have misunderstood Gödel and proved it by their comments. >>>>>>>>>>> I don't know who Stephen Meyer is; my money is on Gödel. >>>>>>>>>>>

    Gödel proved that there cannot possibly exist any
    sequence of inference steps in F prove that they
    themselves do not exist.

    No *FINITE* sequence of inference steps.


    Nothing can prove that itself does not
    exist because that forms proof that it
    does exist, dumbo.

    So you are just ignoring context because you are stupid.

    The statement, with the added information of the meta-system
    proves (by a proof in the meta system) that the statment is true. >>>>>>>

    Something else can prove that X cannot prove that
    X does not exist, AKA your meta-system.

    Nothing can directly prove that itself does not
    exist because this forms proof that it does exist.



    Nope, got a source for that?

    Why does my explanation not work?


    It is not that your explanation doesn't work.
    It is that it ignores the root cause of why
    G is unprovable in F.

    So, how do you think you can prove it in F?


    Nothing can prove that itself does not exist.
    Any such proof would be self-refuting.


    But it isn't the PROOF that does the proving, it is the statement.

    THe statement G exist, and it is True.


    ...We are therefore confronted with a proposition which
    asserts its own unprovability. 15 … (Gödel 1931:40-41)

    When we name this proposition G then a proof of G
    would be a sequence of inference steps that prove
    that they themselves do not exist.

    Anything that asserts its own non-existence
    is necessarily incorrect.

    Because it is true, and can be proven with the additional knowledge and tools  of the meta-system, it shows that without the addtional knowledge and tools you can't make the proof.

    It seems you don't understand that the base system and the meta system
    are different.

    Boy, are you stupid.
    --
    Copyright 2025 Olcott<br><br>

    My 28 year goal has been to make <br>
    "true on the basis of meaning expressed in language"<br>
    reliably computable.<br><br>

    This required establishing a new foundation<br>
    --- Synchronet 3.21a-Linux NewsLink 1.2
  • From Richard Damon@Richard@Damon-Family.org to comp.theory,sci.logic,sci.math,comp.ai.philosophy on Wed Dec 31 20:29:15 2025
    From Newsgroup: comp.ai.philosophy

    On 12/31/25 8:04 PM, olcott wrote:
    On 12/31/2025 6:35 PM, Richard Damon wrote:
    On 12/31/25 7:23 PM, olcott wrote:
    On 12/31/2025 5:27 PM, Richard Damon wrote:
    On 12/31/25 6:08 PM, olcott wrote:
    On 12/31/2025 4:48 PM, Richard Damon wrote:
    On 12/31/25 5:42 PM, olcott wrote:
    On 12/31/2025 4:09 PM, Richard Damon wrote:
    On 12/31/25 4:59 PM, olcott wrote:
    On 12/31/2025 3:56 PM, Richard Damon wrote:
    On 12/31/25 4:52 PM, olcott wrote:
    On 12/31/2025 3:16 PM, Pierre Asselin wrote:
    In sci.logic Tristan Wibberley
    <tristan.wibberley+netnews2@alumni.manchester.ac.uk> wrote: >>>>>>>>>>>>
    [ ... ]
    Then he defines a new system "P" which he uses to get even >>>>>>>>>>>>> more muddled,
    leaves out the crucial elements of his proof because it's >>>>>>>>>>>>> too easy to
    get wrong,

    Gödel, muddled? He was the most meticulous sonovabitch that >>>>>>>>>>>> ever
    lived!


    and Stephen Meyer says he does get it wrong; he seems to be >>>>>>>>>>>>> the only person in the world that ever checked.

    People have misunderstood Gödel and proved it by their >>>>>>>>>>>> comments.
    I don't know who Stephen Meyer is; my money is on Gödel. >>>>>>>>>>>>

    Gödel proved that there cannot possibly exist any
    sequence of inference steps in F prove that they
    themselves do not exist.

    No *FINITE* sequence of inference steps.


    Nothing can prove that itself does not
    exist because that forms proof that it
    does exist, dumbo.

    So you are just ignoring context because you are stupid.

    The statement, with the added information of the meta-system
    proves (by a proof in the meta system) that the statment is true. >>>>>>>>

    Something else can prove that X cannot prove that
    X does not exist, AKA your meta-system.

    Nothing can directly prove that itself does not
    exist because this forms proof that it does exist.



    Nope, got a source for that?

    Why does my explanation not work?


    It is not that your explanation doesn't work.
    It is that it ignores the root cause of why
    G is unprovable in F.

    So, how do you think you can prove it in F?


    Nothing can prove that itself does not exist.
    Any such proof would be self-refuting.


    But it isn't the PROOF that does the proving, it is the statement.

    THe statement G exist, and it is True.


    ...We are therefore confronted with a proposition which
    asserts its own unprovability. 15 … (Gödel 1931:40-41)

    You keep on repeating that, but show you don't know what it means,
    proving your stupidity.


    When we name this proposition G then a proof of G
    would be a sequence of inference steps that prove
    that they themselves do not exist.

    Right, we name the proposition G.

    Then we form a set of steps in M, the Meta-system that proves that G is
    True.

    And, the steps they prove do not exist, are those that live in the base
    system F.

    It is quite possible to travel at a speed in the "Meta-System" "Car"
    that would be impossible to do in the base system "Tricycle".

    Or, to life a 10 Ton block with a hydrolic crane that you could not life
    with your bear hands.

    You don't seem to understand the simple fact that there are two
    different but related systems being talked about, because you are just
    too stupid.

    Sorry, you are just proving your stupidity, and the fact you don't even
    try to answer the problem being pointed out, that you KNOW you are too
    stupid, so you are just going to repeat your know lies because that is
    all you can think of.


    Anything that asserts its own non-existence
    is necessarily incorrect.

    Because it is true, and can be proven with the additional knowledge
    and tools  of the meta-system, it shows that without the addtional
    knowledge and tools you can't make the proof.

    It seems you don't understand that the base system and the meta system
    are different.

    Boy, are you stupid.



    --- Synchronet 3.21a-Linux NewsLink 1.2
  • From olcott@polcott333@gmail.com to comp.theory,sci.logic,sci.math,comp.ai.philosophy on Wed Dec 31 20:15:21 2025
    From Newsgroup: comp.ai.philosophy

    On 12/31/2025 7:29 PM, Richard Damon wrote:
    On 12/31/25 8:04 PM, olcott wrote:
    On 12/31/2025 6:35 PM, Richard Damon wrote:
    On 12/31/25 7:23 PM, olcott wrote:
    On 12/31/2025 5:27 PM, Richard Damon wrote:
    On 12/31/25 6:08 PM, olcott wrote:
    On 12/31/2025 4:48 PM, Richard Damon wrote:
    On 12/31/25 5:42 PM, olcott wrote:
    On 12/31/2025 4:09 PM, Richard Damon wrote:
    On 12/31/25 4:59 PM, olcott wrote:
    On 12/31/2025 3:56 PM, Richard Damon wrote:
    On 12/31/25 4:52 PM, olcott wrote:
    On 12/31/2025 3:16 PM, Pierre Asselin wrote:
    In sci.logic Tristan Wibberley
    <tristan.wibberley+netnews2@alumni.manchester.ac.uk> wrote: >>>>>>>>>>>>>
    [ ... ]
    Then he defines a new system "P" which he uses to get even >>>>>>>>>>>>>> more muddled,
    leaves out the crucial elements of his proof because it's >>>>>>>>>>>>>> too easy to
    get wrong,

    Gödel, muddled? He was the most meticulous sonovabitch that >>>>>>>>>>>>> ever
    lived!


    and Stephen Meyer says he does get it wrong; he seems to be >>>>>>>>>>>>>> the only person in the world that ever checked.

    People have misunderstood Gödel and proved it by their >>>>>>>>>>>>> comments.
    I don't know who Stephen Meyer is; my money is on Gödel. >>>>>>>>>>>>>

    Gödel proved that there cannot possibly exist any
    sequence of inference steps in F prove that they
    themselves do not exist.

    No *FINITE* sequence of inference steps.


    Nothing can prove that itself does not
    exist because that forms proof that it
    does exist, dumbo.

    So you are just ignoring context because you are stupid.

    The statement, with the added information of the meta-system >>>>>>>>> proves (by a proof in the meta system) that the statment is true. >>>>>>>>>

    Something else can prove that X cannot prove that
    X does not exist, AKA your meta-system.

    Nothing can directly prove that itself does not
    exist because this forms proof that it does exist.



    Nope, got a source for that?

    Why does my explanation not work?


    It is not that your explanation doesn't work.
    It is that it ignores the root cause of why
    G is unprovable in F.

    So, how do you think you can prove it in F?


    Nothing can prove that itself does not exist.
    Any such proof would be self-refuting.


    But it isn't the PROOF that does the proving, it is the statement.

    THe statement G exist, and it is True.


    ...We are therefore confronted with a proposition which
    asserts its own unprovability. 15 … (Gödel 1931:40-41)

    You keep on repeating that, but show you don't know what it means,
    proving your stupidity.


    It can only mean one thing when taken 100% literally.

    a proposition which asserts its own unprovability.
    G says that itself is unprovable

    G says that itself has no sequence of inference
    steps that prove that they themselves do not exist.

    It say nothing at all about any meta-system.
    --
    Copyright 2025 Olcott<br><br>

    My 28 year goal has been to make <br>
    "true on the basis of meaning expressed in language"<br>
    reliably computable.<br><br>

    This required establishing a new foundation<br>
    --- Synchronet 3.21a-Linux NewsLink 1.2
  • From Richard Damon@Richard@Damon-Family.org to comp.theory,sci.logic,sci.math,comp.ai.philosophy on Wed Dec 31 21:48:31 2025
    From Newsgroup: comp.ai.philosophy

    On 12/31/25 9:15 PM, olcott wrote:
    On 12/31/2025 7:29 PM, Richard Damon wrote:
    On 12/31/25 8:04 PM, olcott wrote:
    On 12/31/2025 6:35 PM, Richard Damon wrote:
    On 12/31/25 7:23 PM, olcott wrote:
    On 12/31/2025 5:27 PM, Richard Damon wrote:
    On 12/31/25 6:08 PM, olcott wrote:
    On 12/31/2025 4:48 PM, Richard Damon wrote:
    On 12/31/25 5:42 PM, olcott wrote:
    On 12/31/2025 4:09 PM, Richard Damon wrote:
    On 12/31/25 4:59 PM, olcott wrote:
    On 12/31/2025 3:56 PM, Richard Damon wrote:
    On 12/31/25 4:52 PM, olcott wrote:
    On 12/31/2025 3:16 PM, Pierre Asselin wrote:
    In sci.logic Tristan Wibberley
    <tristan.wibberley+netnews2@alumni.manchester.ac.uk> wrote: >>>>>>>>>>>>>>
    [ ... ]
    Then he defines a new system "P" which he uses to get >>>>>>>>>>>>>>> even more muddled,
    leaves out the crucial elements of his proof because it's >>>>>>>>>>>>>>> too easy to
    get wrong,

    Gödel, muddled? He was the most meticulous sonovabitch >>>>>>>>>>>>>> that ever
    lived!


    and Stephen Meyer says he does get it wrong; he seems to be >>>>>>>>>>>>>>> the only person in the world that ever checked.

    People have misunderstood Gödel and proved it by their >>>>>>>>>>>>>> comments.
    I don't know who Stephen Meyer is; my money is on Gödel. >>>>>>>>>>>>>>

    Gödel proved that there cannot possibly exist any
    sequence of inference steps in F prove that they
    themselves do not exist.

    No *FINITE* sequence of inference steps.


    Nothing can prove that itself does not
    exist because that forms proof that it
    does exist, dumbo.

    So you are just ignoring context because you are stupid.

    The statement, with the added information of the meta-system >>>>>>>>>> proves (by a proof in the meta system) that the statment is true. >>>>>>>>>>

    Something else can prove that X cannot prove that
    X does not exist, AKA your meta-system.

    Nothing can directly prove that itself does not
    exist because this forms proof that it does exist.



    Nope, got a source for that?

    Why does my explanation not work?


    It is not that your explanation doesn't work.
    It is that it ignores the root cause of why
    G is unprovable in F.

    So, how do you think you can prove it in F?


    Nothing can prove that itself does not exist.
    Any such proof would be self-refuting.


    But it isn't the PROOF that does the proving, it is the statement.

    THe statement G exist, and it is True.


    ...We are therefore confronted with a proposition which
    asserts its own unprovability. 15 … (Gödel 1931:40-41)

    You keep on repeating that, but show you don't know what it means,
    proving your stupidity.


    It can only mean one thing when taken 100% literally.

    The problem is language is not to be taken "100% literally", and thus
    you just show you don't understand how words have meaning.


    a proposition which asserts its own unprovability.
    G says that itself is unprovable

    G says that itself has no sequence of inference
    steps that prove that they themselves do not exist.

    It say nothing at all about any meta-system.

    Sure it does, as it is in the section talking about an analysis in the meta-syste

    I guess you are just proving you are a total idiot with no understanding
    of the structure of language, which is why your goal of trying to base
    your logic on words and their meaning is so hilarious, since you neve runderstod the nature of language in the first place.
    --- Synchronet 3.21a-Linux NewsLink 1.2
  • From olcott@polcott333@gmail.com to comp.theory,sci.logic,sci.math,comp.ai.philosophy on Wed Dec 31 23:03:33 2025
    From Newsgroup: comp.ai.philosophy

    On 12/31/2025 8:48 PM, Richard Damon wrote:
    On 12/31/25 9:15 PM, olcott wrote:
    On 12/31/2025 7:29 PM, Richard Damon wrote:
    On 12/31/25 8:04 PM, olcott wrote:
    On 12/31/2025 6:35 PM, Richard Damon wrote:
    On 12/31/25 7:23 PM, olcott wrote:
    On 12/31/2025 5:27 PM, Richard Damon wrote:
    On 12/31/25 6:08 PM, olcott wrote:
    On 12/31/2025 4:48 PM, Richard Damon wrote:
    On 12/31/25 5:42 PM, olcott wrote:
    On 12/31/2025 4:09 PM, Richard Damon wrote:
    On 12/31/25 4:59 PM, olcott wrote:
    On 12/31/2025 3:56 PM, Richard Damon wrote:
    On 12/31/25 4:52 PM, olcott wrote:
    On 12/31/2025 3:16 PM, Pierre Asselin wrote:
    In sci.logic Tristan Wibberley
    <tristan.wibberley+netnews2@alumni.manchester.ac.uk> wrote: >>>>>>>>>>>>>>>
    [ ... ]
    Then he defines a new system "P" which he uses to get >>>>>>>>>>>>>>>> even more muddled,
    leaves out the crucial elements of his proof because >>>>>>>>>>>>>>>> it's too easy to
    get wrong,

    Gödel, muddled? He was the most meticulous sonovabitch >>>>>>>>>>>>>>> that ever
    lived!


    and Stephen Meyer says he does get it wrong; he seems to be >>>>>>>>>>>>>>>> the only person in the world that ever checked. >>>>>>>>>>>>>>>
    People have misunderstood Gödel and proved it by their >>>>>>>>>>>>>>> comments.
    I don't know who Stephen Meyer is; my money is on Gödel. >>>>>>>>>>>>>>>

    Gödel proved that there cannot possibly exist any >>>>>>>>>>>>>> sequence of inference steps in F prove that they
    themselves do not exist.

    No *FINITE* sequence of inference steps.


    Nothing can prove that itself does not
    exist because that forms proof that it
    does exist, dumbo.

    So you are just ignoring context because you are stupid. >>>>>>>>>>>
    The statement, with the added information of the meta-system >>>>>>>>>>> proves (by a proof in the meta system) that the statment is >>>>>>>>>>> true.


    Something else can prove that X cannot prove that
    X does not exist, AKA your meta-system.

    Nothing can directly prove that itself does not
    exist because this forms proof that it does exist.



    Nope, got a source for that?

    Why does my explanation not work?


    It is not that your explanation doesn't work.
    It is that it ignores the root cause of why
    G is unprovable in F.

    So, how do you think you can prove it in F?


    Nothing can prove that itself does not exist.
    Any such proof would be self-refuting.


    But it isn't the PROOF that does the proving, it is the statement.

    THe statement G exist, and it is True.


    ...We are therefore confronted with a proposition which
    asserts its own unprovability. 15 … (Gödel 1931:40-41)

    You keep on repeating that, but show you don't know what it means,
    proving your stupidity.


    It can only mean one thing when taken 100% literally.

    The problem is language is not to be taken "100% literally", and thus
    you just show you don't understand how words have meaning.


    Formal mathematical specifications are taken literally or incorrectly.

    a proposition which asserts its own unprovability.
    G says that itself is unprovable

    G says that itself has no sequence of inference
    steps that prove that they themselves do not exist.

    "a proposition which asserts its own unprovability."
    says nothing at all about any meta-system.


    a proposition which asserts its own unprovability.
    G says that itself is unprovable

    G says that itself has no sequence of inference
    steps that prove that they themselves do not exist.

    It say nothing at all about any meta-system.

    Sure it does, as it is in the section talking about an analysis in the meta-syste

    I guess you are just proving you are a total idiot with no understanding
    of the structure of language, which is why your goal of trying to base
    your logic on words and their meaning is so hilarious, since you neve runderstod the nature of language in the first place.
    --
    Copyright 2025 Olcott<br><br>

    My 28 year goal has been to make <br>
    "true on the basis of meaning expressed in language"<br>
    reliably computable.<br><br>

    This required establishing a new foundation<br>
    --- Synchronet 3.21a-Linux NewsLink 1.2
  • From Tristan Wibberley@tristan.wibberley+netnews2@alumni.manchester.ac.uk to comp.theory,sci.logic,sci.math,comp.ai.philosophy on Thu Jan 1 10:41:18 2026
    From Newsgroup: comp.ai.philosophy

    On 31/12/2025 21:16, Pierre Asselin wrote:
    In sci.logic Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> wrote:

    [ ... ]
    Then he defines a new system "P" which he uses to get even more muddled,
    leaves out the crucial elements of his proof because it's too easy to
    get wrong,

    Gödel, muddled? He was the most meticulous sonovabitch that ever
    lived!

    Have you heard about his musings on God?


    and Stephen Meyer says he does get it wrong; he seems to be
    the only person in the world that ever checked.

    People have misunderstood Gödel and proved it by their comments.
    I don't know who Stephen Meyer is; my money is on Gödel.


    I misremembered, it was James Meyer. He has a website on it http://www.jamesrmeyer.com . He's very angry about people telling him
    he's wrong but who never checked like he did because they keep telling
    him reasons it's right that he's certain are not reflected in the actual
    work.
    --
    Tristan Wibberley

    The message body is Copyright (C) 2025 Tristan Wibberley except
    citations and quotations noted. All Rights Reserved except that you may,
    of course, cite it academically giving credit to me, distribute it
    verbatim as part of a usenet system or its archives, and use it to
    promote my greatness and general superiority without misrepresentation
    of my opinions other than my opinion of my greatness and general
    superiority which you _may_ misrepresent. You definitely MAY NOT train
    any production AI system with it but you may train experimental AI that
    will only be used for evaluation of the AI methods it implements.

    --- Synchronet 3.21a-Linux NewsLink 1.2
  • From Richard Damon@Richard@Damon-Family.org to comp.theory,sci.logic,sci.math,comp.ai.philosophy on Thu Jan 1 11:49:10 2026
    From Newsgroup: comp.ai.philosophy

    On 1/1/26 12:03 AM, olcott wrote:
    On 12/31/2025 8:48 PM, Richard Damon wrote:
    On 12/31/25 9:15 PM, olcott wrote:
    On 12/31/2025 7:29 PM, Richard Damon wrote:
    On 12/31/25 8:04 PM, olcott wrote:
    On 12/31/2025 6:35 PM, Richard Damon wrote:
    On 12/31/25 7:23 PM, olcott wrote:
    On 12/31/2025 5:27 PM, Richard Damon wrote:
    On 12/31/25 6:08 PM, olcott wrote:
    On 12/31/2025 4:48 PM, Richard Damon wrote:
    On 12/31/25 5:42 PM, olcott wrote:
    On 12/31/2025 4:09 PM, Richard Damon wrote:
    On 12/31/25 4:59 PM, olcott wrote:
    On 12/31/2025 3:56 PM, Richard Damon wrote:
    On 12/31/25 4:52 PM, olcott wrote:
    On 12/31/2025 3:16 PM, Pierre Asselin wrote:
    In sci.logic Tristan Wibberley
    <tristan.wibberley+netnews2@alumni.manchester.ac.uk> wrote: >>>>>>>>>>>>>>>>
    [ ... ]
    Then he defines a new system "P" which he uses to get >>>>>>>>>>>>>>>>> even more muddled,
    leaves out the crucial elements of his proof because >>>>>>>>>>>>>>>>> it's too easy to
    get wrong,

    Gödel, muddled? He was the most meticulous sonovabitch >>>>>>>>>>>>>>>> that ever
    lived!


    and Stephen Meyer says he does get it wrong; he seems >>>>>>>>>>>>>>>>> to be
    the only person in the world that ever checked. >>>>>>>>>>>>>>>>
    People have misunderstood Gödel and proved it by their >>>>>>>>>>>>>>>> comments.
    I don't know who Stephen Meyer is; my money is on Gödel. >>>>>>>>>>>>>>>>

    Gödel proved that there cannot possibly exist any >>>>>>>>>>>>>>> sequence of inference steps in F prove that they >>>>>>>>>>>>>>> themselves do not exist.

    No *FINITE* sequence of inference steps.


    Nothing can prove that itself does not
    exist because that forms proof that it
    does exist, dumbo.

    So you are just ignoring context because you are stupid. >>>>>>>>>>>>
    The statement, with the added information of the meta-system >>>>>>>>>>>> proves (by a proof in the meta system) that the statment is >>>>>>>>>>>> true.


    Something else can prove that X cannot prove that
    X does not exist, AKA your meta-system.

    Nothing can directly prove that itself does not
    exist because this forms proof that it does exist.



    Nope, got a source for that?

    Why does my explanation not work?


    It is not that your explanation doesn't work.
    It is that it ignores the root cause of why
    G is unprovable in F.

    So, how do you think you can prove it in F?


    Nothing can prove that itself does not exist.
    Any such proof would be self-refuting.


    But it isn't the PROOF that does the proving, it is the statement. >>>>>>
    THe statement G exist, and it is True.


    ...We are therefore confronted with a proposition which
    asserts its own unprovability. 15 … (Gödel 1931:40-41)

    You keep on repeating that, but show you don't know what it means,
    proving your stupidity.


    It can only mean one thing when taken 100% literally.

    The problem is language is not to be taken "100% literally", and thus
    you just show you don't understand how words have meaning.


    Formal mathematical specifications are taken literally or incorrectly.


    Which only applies to formal mathematical specifications, and not to
    just natural language statements made in a paper.

    a proposition which asserts its own unprovability.
    G says that itself is unprovable

    Which is a Natural Language interpretation of the Formal Mathematical statement which G is, based on the additional meaning it obtains from
    the mete system M.

    G is actually a preposition about the non-existance of a Natural Number
    g that satisfies a particular mathematical relationship. That
    relationship in F is just some complicated formula that can be evaluated
    for any Natural Number, but the meta-system M understands that encoded
    into this formula is a proof checker of proofs of the statement G
    encoded into a number by rules in M of proofs in F.


    G says that itself has no sequence of inference
    steps that prove that they themselves do not exist.

    Yes, from knowledge obtain in M, we can understand G to mean that there
    is no sequence if F that proves it.

    You seem to be confusing the sequence of steps which prove a statement
    with the statement itself.

    Typical of you, as you have shown you don't know what "Proof" means,
    amoung your many other misunderstood words.


    "a proposition which asserts its own unprovability."
    says nothing at all about any meta-system.

    Because you are taking the statement out of its context.

    I guess you just just don't understand how languages work.

    Note, even formal mathematical specifications will depend on context,
    and most won't indicate what system they are made in, but that comes out
    of the context they were made in.

    All you are doing is proving that you are dumber that even the AI LLMs
    that you praise, because at least they look at tbe full context of a
    sttaement (even if only mechanically).

    Thus, you prove that you are just an ignorant pathological liar.



    a proposition which asserts its own unprovability.
    G says that itself is unprovable

    G says that itself has no sequence of inference
    steps that prove that they themselves do not exist.

    It say nothing at all about any meta-system.

    Sure it does, as it is in the section talking about an analysis in the
    meta-syste

    I guess you are just proving you are a total idiot with no
    understanding of the structure of language, which is why your goal of
    trying to base your logic on words and their meaning is so hilarious,
    since you neve runderstod the nature of language in the first place.



    --- Synchronet 3.21a-Linux NewsLink 1.2
  • From Richard Damon@Richard@Damon-Family.org to comp.theory,sci.logic,sci.math,comp.ai.philosophy on Thu Jan 1 12:34:27 2026
    From Newsgroup: comp.ai.philosophy

    On 1/1/26 5:41 AM, Tristan Wibberley wrote:
    On 31/12/2025 21:16, Pierre Asselin wrote:
    In sci.logic Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> wrote:

    [ ... ]
    Then he defines a new system "P" which he uses to get even more muddled, >>> leaves out the crucial elements of his proof because it's too easy to
    get wrong,

    Gödel, muddled? He was the most meticulous sonovabitch that ever
    lived!

    Have you heard about his musings on God?


    and Stephen Meyer says he does get it wrong; he seems to be
    the only person in the world that ever checked.

    People have misunderstood Gödel and proved it by their comments.
    I don't know who Stephen Meyer is; my money is on Gödel.


    I misremembered, it was James Meyer. He has a website on it http://www.jamesrmeyer.com . He's very angry about people telling him
    he's wrong but who never checked like he did because they keep telling
    him reasons it's right that he's certain are not reflected in the actual work.


    In other words, since he doesn't understand it, it must be wrong.


    Since his page begins with a rejection of the axiom of Choice, and the
    example he gives, it shows a limitation in his ability to understand the nature of infinite systems.

    To expect that infinite systems behave just like we see finite systems
    work is a funamental error.

    Yes, it seems to create paradoxes, but those paradoxes are only apparent
    due to the lack of understanding about the actual nature of infinite sets.
    --- Synchronet 3.21a-Linux NewsLink 1.2
  • From dart200@user7160@newsgrouper.org.invalid to comp.theory,sci.logic,sci.math,comp.ai.philosophy on Thu Jan 1 10:59:45 2026
    From Newsgroup: comp.ai.philosophy

    On 1/1/26 9:34 AM, Richard Damon wrote:
    On 1/1/26 5:41 AM, Tristan Wibberley wrote:
    On 31/12/2025 21:16, Pierre Asselin wrote:
    In sci.logic Tristan Wibberley
    <tristan.wibberley+netnews2@alumni.manchester.ac.uk> wrote:

    [ ... ]
    Then he defines a new system "P" which he uses to get even more
    muddled,
    leaves out the crucial elements of his proof because it's too easy to
    get wrong,

    Gödel, muddled? He was the most meticulous sonovabitch that ever
    lived!

    Have you heard about his musings on God?


    and Stephen Meyer says he does get it wrong; he seems to be
    the only person in the world that ever checked.

    People have misunderstood Gödel and proved it by their comments.
    I don't know who Stephen Meyer is; my money is on Gödel.


    I misremembered, it was James Meyer. He has a website on it
    http://www.jamesrmeyer.com . He's very angry about people telling him
    he's wrong but who never checked like he did because they keep telling
    him reasons it's right that he's certain are not reflected in the actual
    work.


    i tried to talk to that fool. he banned me pretty quickly so obviously
    it's a fucking idiot


    In other words, since he doesn't understand it, it must be wrong.


    Since his page begins with a rejection of the axiom of Choice, and the example he gives, it shows a limitation in his ability to understand the nature of infinite systems.

    To expect that infinite systems behave just like we see finite systems
    work is a funamental error.

    Yes, it seems to create paradoxes, but those paradoxes are only apparent
    due to the lack of understanding about the actual nature of infinite sets.
    --
    a burnt out swe investigating into why our tooling doesn't involve
    basic semantic proofs like halting analysis

    please excuse my pseudo-pyscript,

    ~ nick
    --- Synchronet 3.21a-Linux NewsLink 1.2
  • From Tristan Wibberley@tristan.wibberley+netnews2@alumni.manchester.ac.uk to comp.theory,sci.logic,sci.math,comp.ai.philosophy on Thu Jan 1 22:13:48 2026
    From Newsgroup: comp.ai.philosophy

    On 01/01/2026 00:35, Richard Damon wrote:

    THe statement G exist


    Ah, I'm not so easily convinced
    --
    Tristan Wibberley

    The message body is Copyright (C) 2025 Tristan Wibberley except
    citations and quotations noted. All Rights Reserved except that you may,
    of course, cite it academically giving credit to me, distribute it
    verbatim as part of a usenet system or its archives, and use it to
    promote my greatness and general superiority without misrepresentation
    of my opinions other than my opinion of my greatness and general
    superiority which you _may_ misrepresent. You definitely MAY NOT train
    any production AI system with it but you may train experimental AI that
    will only be used for evaluation of the AI methods it implements.

    --- Synchronet 3.21a-Linux NewsLink 1.2
  • From Richard Damon@Richard@Damon-Family.org to comp.theory,sci.logic,sci.math,comp.ai.philosophy on Thu Jan 1 17:42:13 2026
    From Newsgroup: comp.ai.philosophy

    On 1/1/26 5:13 PM, Tristan Wibberley wrote:
    On 01/01/2026 00:35, Richard Damon wrote:

    THe statement G exist


    Ah, I'm not so easily convinced



    What did he do that might allow it not to exist?

    He constructs it by the rules of F, and shows that for it to not be
    true, F must be inconsistant.

    You can't just complain that you don't think something exists, when it
    was constructed by the system.
    --- Synchronet 3.21a-Linux NewsLink 1.2
  • From x@x@x.net to comp.theory,sci.logic,sci.math,comp.ai.philosophy on Fri Jan 2 09:54:08 2026
    From Newsgroup: comp.ai.philosophy

    On 1/1/26 09:34, Richard Damon wrote:
    On 1/1/26 5:41 AM, Tristan Wibberley wrote:
    On 31/12/2025 21:16, Pierre Asselin wrote:
    In sci.logic Tristan Wibberley
    <tristan.wibberley+netnews2@alumni.manchester.ac.uk> wrote:

    [ ... ]
    Then he defines a new system "P" which he uses to get even more
    muddled,
    leaves out the crucial elements of his proof because it's too easy to
    get wrong,

    Gödel, muddled? He was the most meticulous sonovabitch that ever
    lived!

    Have you heard about his musings on God?


    and Stephen Meyer says he does get it wrong; he seems to be
    the only person in the world that ever checked.

    People have misunderstood Gödel and proved it by their comments.
    I don't know who Stephen Meyer is; my money is on Gödel.


    I misremembered, it was James Meyer. He has a website on it
    http://www.jamesrmeyer.com . He's very angry about people telling him
    he's wrong but who never checked like he did because they keep telling
    him reasons it's right that he's certain are not reflected in the actual
    work.


    In other words, since he doesn't understand it, it must be wrong.

    Is that a bad definition based upon philosophic idealism?

    If no one understands it, why can it not be wrong?

    If no one explains it, doesn't it become more and
    more wrong as people do not bother to explain it?

    Since his page begins with a rejection of the axiom of Choice,
    What is the axiom of choice?

    ? and the
    example he gives,

    I generally do not want to bother sifting through all of
    the threads to find this theoretical example. Where is
    that?

    it shows a limitation in his ability to understand the
    nature of infinite systems.

    I do not understand this. I am ok with the idea that
    it is wrong until it is explained.

    If you do not explain it that tells me that you do
    not care about the concept yourself.

    To expect that infinite systems behave just like we see finite systems
    work is a funamental error.

    Yes, it seems to create paradoxes, but those paradoxes are only apparent
    due to the lack of understanding about the actual nature of infinite
    sets.
    --- Synchronet 3.21a-Linux NewsLink 1.2