• =?UTF-8?Q?Boiling_G=C3=B6del=27s_1931_Incompleteness_down_to_its_es?= =?UTF-8?Q?sence?=

    From olcott@polcott333@gmail.com to comp.theory,sci.logic,sci.math,comp.ai.philosophy on Thu Jan 1 08:45:19 2026
    From Newsgroup: sci.logic

    *When we analyze this one statement made in isolation*

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

    G asserts its own unprovability.

    G asserts that there are no sequence of inference
    steps that prove that they themselves do not exist.

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

    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 Thu Jan 1 12:30:09 2026
    From Newsgroup: sci.logic

    On 1/1/26 9:45 AM, olcott wrote:
    *When we analyze this one statement made in isolation*

    Which is invalid, as it ignore the context of the statement.


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

    G asserts its own unprovability.

    G asserts that there are no sequence of inference
    steps that prove that they themselves do not exist.

    No, G asserts, by its interpretation in M, a meta-system of F with
    additional axioms, that there exist no FINITE sequence of inference
    steps IN F that prove the statement G.

    The system M, with its additional axioms, can prove by a FINITE set of inference steps if M, that theee are an INFINITE number of inference
    steps in F that prove that there is no FINITE set of inference steps in
    F to prove it,

    All you are doing is PROVING that you don't understand the concept of Meta-System, because you don't understand Formal Logic, likely because
    it has rules that need to be followed.

    You also show that you don't understand what a PROOF is, and that it
    needs to be FINITE, while truth allows INFINITE operations to estblish
    (part of the definition of "semantics" in formal logic).

    All of this is because you don't understand what Truth actually is as
    distinct from Knowledge, which perhaps stems from your limited
    understanding of higher order logic.


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

    And where do you get this from?

    Since you ignore the concept of different levels of interpretation, you
    just place your self out of formal logic.


    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 Thu Jan 1 12:08:32 2026
    From Newsgroup: sci.logic

    On 1/1/2026 11:30 AM, Richard Damon wrote:
    On 1/1/26 9:45 AM, olcott wrote:
    *When we analyze this one statement made in isolation*

    Which is invalid, as it ignore the context of the statement.


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

    G asserts its own unprovability.

    G asserts that there are no sequence of inference
    steps that prove that they themselves do not exist.

    No, G asserts, by its interpretation in M, a meta-system of F with additional axioms, that there exist no FINITE sequence of inference
    steps IN F that prove the statement G.


    That is not what G itself says. That is merely the
    extra baggage of one man's way of examining G.

    The barest essence of G is:
    G asserts its own unprovability.

    When we examine what this semantically entails:
    G asserts that there are no sequence of inference
    steps that prove that they themselves do not 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 Thu Jan 1 13:57:00 2026
    From Newsgroup: sci.logic

    On 1/1/26 1:08 PM, olcott wrote:
    On 1/1/2026 11:30 AM, Richard Damon wrote:
    On 1/1/26 9:45 AM, olcott wrote:
    *When we analyze this one statement made in isolation*

    Which is invalid, as it ignore the context of the statement.


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

    G asserts its own unprovability.

    G asserts that there are no sequence of inference
    steps that prove that they themselves do not exist.

    No, G asserts, by its interpretation in M, a meta-system of F with
    additional axioms, that there exist no FINITE sequence of inference
    steps IN F that prove the statement G.


    That is not what G itself says. That is merely the
    extra baggage of one man's way of examining G.

    RIght, G itself say that there exsits no number that


    The barest essence of G is:
    G asserts its own unprovability.

    Nope, that it the INTERPRETATION of G, which can only be seen in the
    meta system.

    The barest essential of G is what G actually says, which is that no
    number g exist that meets the requirements of that given relationship.

    You are just showing you don't know what your words mean.


    When we examine what this semantically entails:
    G asserts that there are no sequence of inference
    steps that prove that they themselves do not exist.


    Nope, you are just showing you don't understand the words.

    The fundamental meaning of G is that no number exist that meets the
    particular relationship.

    The MEANING of this, only derivable in M, is that there can be no proof
    of G in F.

    Thus, the semanctic entailment of G, when we include the semantics of M,
    is that there is no sequence IN F, that prove G.

    Since F and M are DIFFERENT, since M "knows" more than F, your claim
    doesn't hold, but just shows that you fundamentally don't understand how
    logic works, or even what "Semantics" are, and thus what "Semantic
    Entailment" means.

    --- Synchronet 3.21a-Linux NewsLink 1.2
  • From olcott@polcott333@gmail.com to comp.theory,sci.logic,sci.math,comp.ai.philosophy on Thu Jan 1 14:03:50 2026
    From Newsgroup: sci.logic

    On 1/1/2026 12:57 PM, Richard Damon wrote:
    On 1/1/26 1:08 PM, olcott wrote:
    On 1/1/2026 11:30 AM, Richard Damon wrote:
    On 1/1/26 9:45 AM, olcott wrote:
    *When we analyze this one statement made in isolation*

    Which is invalid, as it ignore the context of the statement.


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

    G asserts its own unprovability.

    G asserts that there are no sequence of inference
    steps that prove that they themselves do not exist.

    No, G asserts, by its interpretation in M, a meta-system of F with
    additional axioms, that there exist no FINITE sequence of inference
    steps IN F that prove the statement G.


    That is not what G itself says. That is merely the
    extra baggage of one man's way of examining G.

    RIght, G itself say that there exsits no number that


    The barest essence of G is:
    G asserts its own unprovability.

    Nope, that it the INTERPRETATION of G, which can only be seen in the
    meta system.

    The barest essential of G is what G actually says, which is that no
    number g exist that meets the requirements of that given relationship.


    The barest essence of that English sentence
    taken in isolation: G asserts its own unprovability.
    --
    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 Thu Jan 1 15:13:52 2026
    From Newsgroup: sci.logic

    On 1/1/26 3:03 PM, olcott wrote:
    On 1/1/2026 12:57 PM, Richard Damon wrote:
    On 1/1/26 1:08 PM, olcott wrote:
    On 1/1/2026 11:30 AM, Richard Damon wrote:
    On 1/1/26 9:45 AM, olcott wrote:
    *When we analyze this one statement made in isolation*

    Which is invalid, as it ignore the context of the statement.


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

    G asserts its own unprovability.

    G asserts that there are no sequence of inference
    steps that prove that they themselves do not exist.

    No, G asserts, by its interpretation in M, a meta-system of F with
    additional axioms, that there exist no FINITE sequence of inference
    steps IN F that prove the statement G.


    That is not what G itself says. That is merely the
    extra baggage of one man's way of examining G.

    RIght, G itself say that there exsits no number that


    The barest essence of G is:
    G asserts its own unprovability.

    Nope, that it the INTERPRETATION of G, which can only be seen in the
    meta system.

    The barest essential of G is what G actually says, which is that no
    number g exist that meets the requirements of that given relationship.


    The barest essence of that English sentence
    taken in isolation: G asserts its own unprovability.


    You don't seem to understand that you can't take sentences out of
    context and understand what they mean.

    I guess you are just proving that you are just too stupid to understand
    the basics of communication, or sematics.


    --- Synchronet 3.21a-Linux NewsLink 1.2
  • From olcott@polcott333@gmail.com to comp.theory,sci.logic,sci.math,comp.ai.philosophy on Thu Jan 1 15:46:53 2026
    From Newsgroup: sci.logic

    On 1/1/2026 2:13 PM, Richard Damon wrote:
    On 1/1/26 3:03 PM, olcott wrote:
    On 1/1/2026 12:57 PM, Richard Damon wrote:
    On 1/1/26 1:08 PM, olcott wrote:
    On 1/1/2026 11:30 AM, Richard Damon wrote:
    On 1/1/26 9:45 AM, olcott wrote:
    *When we analyze this one statement made in isolation*

    Which is invalid, as it ignore the context of the statement.


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

    G asserts its own unprovability.

    G asserts that there are no sequence of inference
    steps that prove that they themselves do not exist.

    No, G asserts, by its interpretation in M, a meta-system of F with
    additional axioms, that there exist no FINITE sequence of inference >>>>> steps IN F that prove the statement G.


    That is not what G itself says. That is merely the
    extra baggage of one man's way of examining G.

    RIght, G itself say that there exsits no number that


    The barest essence of G is:
    G asserts its own unprovability.

    Nope, that it the INTERPRETATION of G, which can only be seen in the
    meta system.

    The barest essential of G is what G actually says, which is that no
    number g exist that meets the requirements of that given relationship.


    The barest essence of that English sentence
    taken in isolation: G asserts its own unprovability.


    You don't seem to understand that you can't take sentences out of
    context and understand what they mean.


    You don't understand that it still
    retains the compositional meaning
    of the meaning of its words.

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

    I guess you are just proving that you are just too stupid to understand
    the basics of communication, or sematics.


    --
    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 Thu Jan 1 17:01:43 2026
    From Newsgroup: sci.logic

    On 1/1/26 4:46 PM, olcott wrote:
    On 1/1/2026 2:13 PM, Richard Damon wrote:
    On 1/1/26 3:03 PM, olcott wrote:
    On 1/1/2026 12:57 PM, Richard Damon wrote:
    On 1/1/26 1:08 PM, olcott wrote:
    On 1/1/2026 11:30 AM, Richard Damon wrote:
    On 1/1/26 9:45 AM, olcott wrote:
    *When we analyze this one statement made in isolation*

    Which is invalid, as it ignore the context of the statement.


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

    G asserts its own unprovability.

    G asserts that there are no sequence of inference
    steps that prove that they themselves do not exist.

    No, G asserts, by its interpretation in M, a meta-system of F with >>>>>> additional axioms, that there exist no FINITE sequence of
    inference steps IN F that prove the statement G.


    That is not what G itself says. That is merely the
    extra baggage of one man's way of examining G.

    RIght, G itself say that there exsits no number that


    The barest essence of G is:
    G asserts its own unprovability.

    Nope, that it the INTERPRETATION of G, which can only be seen in the
    meta system.

    The barest essential of G is what G actually says, which is that no
    number g exist that meets the requirements of that given relationship. >>>>

    The barest essence of that English sentence
    taken in isolation: G asserts its own unprovability.


    You don't seem to understand that you can't take sentences out of
    context and understand what they mean.


    You don't understand that it still
    retains the compositional meaning
    of the meaning of its words.

    An the meaning of the words are based on the context.


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

    Right, The assertion is in M
    The unprovability is in F

    Noting inconsistant with that, as M is more powerful than F

    Your stupidity is amazing.

    You really have burnt out your brain by your self-brainwashing.


    I guess you are just proving that you are just too stupid to
    understand the basics of communication, or sematics.





    --- Synchronet 3.21a-Linux NewsLink 1.2
  • From olcott@polcott333@gmail.com to comp.theory,sci.logic,sci.math,comp.ai.philosophy on Thu Jan 1 16:05:56 2026
    From Newsgroup: sci.logic

    On 1/1/2026 4:01 PM, Richard Damon wrote:
    On 1/1/26 4:46 PM, olcott wrote:
    On 1/1/2026 2:13 PM, Richard Damon wrote:
    On 1/1/26 3:03 PM, olcott wrote:
    On 1/1/2026 12:57 PM, Richard Damon wrote:
    On 1/1/26 1:08 PM, olcott wrote:
    On 1/1/2026 11:30 AM, Richard Damon wrote:
    On 1/1/26 9:45 AM, olcott wrote:
    *When we analyze this one statement made in isolation*

    Which is invalid, as it ignore the context of the statement.


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

    G asserts its own unprovability.

    G asserts that there are no sequence of inference
    steps that prove that they themselves do not exist.

    No, G asserts, by its interpretation in M, a meta-system of F
    with additional axioms, that there exist no FINITE sequence of
    inference steps IN F that prove the statement G.


    That is not what G itself says. That is merely the
    extra baggage of one man's way of examining G.

    RIght, G itself say that there exsits no number that


    The barest essence of G is:
    G asserts its own unprovability.

    Nope, that it the INTERPRETATION of G, which can only be seen in
    the meta system.

    The barest essential of G is what G actually says, which is that no >>>>> number g exist that meets the requirements of that given relationship. >>>>>

    The barest essence of that English sentence
    taken in isolation: G asserts its own unprovability.


    You don't seem to understand that you can't take sentences out of
    context and understand what they mean.


    You don't understand that it still
    retains the compositional meaning
    of the meaning of its words.

    An the meaning of the words are based on the context.


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

    Right, The assertion is in M
    The unprovability is in F

    Noting inconsistant with that, as M is more powerful than F

    Your stupidity is amazing.

    You really have burnt out your brain by your self-brainwashing.


    In semantics, mathematical logic and related disciplines,
    the principle of compositionality is the principle that
    the meaning of a complex expression is determined by the
    meanings of its constituent expressions and the rules
    used to combine them. The principle is also called
    Frege's principle, because Gottlob Frege is widely
    credited for the first modern formulation of it.

    https://en.wikipedia.org/wiki/Principle_of_compositionality
    Context is an entirely different thing.


    I guess you are just proving that you are just too stupid to
    understand the basics of communication, or sematics.





    --
    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 Thu Jan 1 17:32:14 2026
    From Newsgroup: sci.logic

    On 1/1/26 5:05 PM, olcott wrote:
    On 1/1/2026 4:01 PM, Richard Damon wrote:
    On 1/1/26 4:46 PM, olcott wrote:
    On 1/1/2026 2:13 PM, Richard Damon wrote:
    On 1/1/26 3:03 PM, olcott wrote:
    On 1/1/2026 12:57 PM, Richard Damon wrote:
    On 1/1/26 1:08 PM, olcott wrote:
    On 1/1/2026 11:30 AM, Richard Damon wrote:
    On 1/1/26 9:45 AM, olcott wrote:
    *When we analyze this one statement made in isolation*

    Which is invalid, as it ignore the context of the statement.


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

    G asserts its own unprovability.

    G asserts that there are no sequence of inference
    steps that prove that they themselves do not exist.

    No, G asserts, by its interpretation in M, a meta-system of F >>>>>>>> with additional axioms, that there exist no FINITE sequence of >>>>>>>> inference steps IN F that prove the statement G.


    That is not what G itself says. That is merely the
    extra baggage of one man's way of examining G.

    RIght, G itself say that there exsits no number that


    The barest essence of G is:
    G asserts its own unprovability.

    Nope, that it the INTERPRETATION of G, which can only be seen in
    the meta system.

    The barest essential of G is what G actually says, which is that
    no number g exist that meets the requirements of that given
    relationship.


    The barest essence of that English sentence
    taken in isolation: G asserts its own unprovability.


    You don't seem to understand that you can't take sentences out of
    context and understand what they mean.


    You don't understand that it still
    retains the compositional meaning
    of the meaning of its words.

    An the meaning of the words are based on the context.


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

    Right, The assertion is in M
    The unprovability is in F

    Noting inconsistant with that, as M is more powerful than F

    Your stupidity is amazing.

    You really have burnt out your brain by your self-brainwashing.


    In semantics, mathematical logic and related disciplines,
    the principle of compositionality is the principle that
    the meaning of a complex expression is determined by the
    meanings of its constituent expressions and the rules
    used to combine them. The principle is also called
    Frege's principle, because Gottlob Frege is widely
    credited for the first modern formulation of it.

    But, the statement yo are looking at isn't a statement of mathematical
    riger, but a Natural Language explamation of a result.

    The ACTUAL statement, mentioned prior in the discussion, does precisely
    give the mathematical meaning, and then Godel, to help the reader
    understand what that says, translates it to a simple Natural Language statement.

    Again, your problem is you just don't understand how context works, and
    don't see what parts in the paper are Formal statements, and what parts
    are the Natural Language explainations.

    All you are doing by trying to invoke that principle is to demonstrate
    you don't know what you, or it, is talking about.

    For instance, the word "proposition" in this context references the INTERPREATION of G in M, and the "unprovability" reference that property
    in F. These meanings come from the CONTEXT which affect the meaning of
    words of Natural Language.

    Note, that his Formal Statements use mathematical notation, while this statement does not, thus is clearly a Natural Language statement to be interpreted by the "rules" of Natural Language.


    https://en.wikipedia.org/wiki/Principle_of_compositionality
    Context is an entirely different thing.


    I guess you are just proving that you are just too stupid to
    understand the basics of communication, or sematics.








    --- Synchronet 3.21a-Linux NewsLink 1.2
  • From olcott@polcott333@gmail.com to comp.theory,sci.logic,sci.math,comp.ai.philosophy on Thu Jan 1 16:44:46 2026
    From Newsgroup: sci.logic

    On 1/1/2026 4:32 PM, Richard Damon wrote:
    On 1/1/26 5:05 PM, olcott wrote:
    On 1/1/2026 4:01 PM, Richard Damon wrote:
    On 1/1/26 4:46 PM, olcott wrote:
    On 1/1/2026 2:13 PM, Richard Damon wrote:
    On 1/1/26 3:03 PM, olcott wrote:
    On 1/1/2026 12:57 PM, Richard Damon wrote:
    On 1/1/26 1:08 PM, olcott wrote:
    On 1/1/2026 11:30 AM, Richard Damon wrote:
    On 1/1/26 9:45 AM, olcott wrote:
    *When we analyze this one statement made in isolation*

    Which is invalid, as it ignore the context of the statement. >>>>>>>>>

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

    G asserts its own unprovability.

    G asserts that there are no sequence of inference
    steps that prove that they themselves do not exist.

    No, G asserts, by its interpretation in M, a meta-system of F >>>>>>>>> with additional axioms, that there exist no FINITE sequence of >>>>>>>>> inference steps IN F that prove the statement G.


    That is not what G itself says. That is merely the
    extra baggage of one man's way of examining G.

    RIght, G itself say that there exsits no number that


    The barest essence of G is:
    G asserts its own unprovability.

    Nope, that it the INTERPRETATION of G, which can only be seen in >>>>>>> the meta system.

    The barest essential of G is what G actually says, which is that >>>>>>> no number g exist that meets the requirements of that given
    relationship.


    The barest essence of that English sentence
    taken in isolation: G asserts its own unprovability.


    You don't seem to understand that you can't take sentences out of
    context and understand what they mean.


    You don't understand that it still
    retains the compositional meaning
    of the meaning of its words.

    An the meaning of the words are based on the context.


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

    Right, The assertion is in M
    The unprovability is in F

    Noting inconsistant with that, as M is more powerful than F

    Your stupidity is amazing.

    You really have burnt out your brain by your self-brainwashing.


    In semantics, mathematical logic and related disciplines,
    the principle of compositionality is the principle that
    the meaning of a complex expression is determined by the
    meanings of its constituent expressions and the rules
    used to combine them. The principle is also called
    Frege's principle, because Gottlob Frege is widely
    credited for the first modern formulation of it.

    But, the statement yo are looking at isn't a statement of mathematical riger, but a Natural Language explamation of a result.


    That is why I created Minimal Type Theory https://philarchive.org/archive/PETMTT-4v2\
    G := ~Provable(G)

    G asserts its own unprovability.

    which semantically entails

    G asserts that there are no sequence of inference
    steps that prove that they themselves do not exist.

    The ACTUAL statement, mentioned prior in the discussion, does precisely
    give the mathematical meaning, and then Godel, to help the reader
    understand what that says, translates it to a simple Natural Language statement.

    Again, your problem is you just don't understand how context works, and don't see what parts in the paper are Formal statements, and what parts
    are the Natural Language explainations.

    All you are doing by trying to invoke that principle is to demonstrate
    you don't know what you, or it, is talking about.

    For instance, the word "proposition" in this context references the INTERPREATION of G in M, and the "unprovability" reference that property
    in F. These meanings come from the CONTEXT which affect the meaning of
    words of Natural Language.

    Note, that his Formal Statements use mathematical notation, while this statement does not, thus is clearly a Natural Language statement to be interpreted by the "rules" of Natural Language.


    https://en.wikipedia.org/wiki/Principle_of_compositionality
    Context is an entirely different thing.


    I guess you are just proving that you are just too stupid to
    understand the basics of communication, or sematics.








    --
    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 Thu Jan 1 18:13:39 2026
    From Newsgroup: sci.logic

    On 1/1/26 5:44 PM, olcott wrote:
    On 1/1/2026 4:32 PM, Richard Damon wrote:
    On 1/1/26 5:05 PM, olcott wrote:
    On 1/1/2026 4:01 PM, Richard Damon wrote:
    On 1/1/26 4:46 PM, olcott wrote:
    On 1/1/2026 2:13 PM, Richard Damon wrote:
    On 1/1/26 3:03 PM, olcott wrote:
    On 1/1/2026 12:57 PM, Richard Damon wrote:
    On 1/1/26 1:08 PM, olcott wrote:
    On 1/1/2026 11:30 AM, Richard Damon wrote:
    On 1/1/26 9:45 AM, olcott wrote:
    *When we analyze this one statement made in isolation*

    Which is invalid, as it ignore the context of the statement. >>>>>>>>>>

    ...We are therefore confronted with a proposition which
    asserts its own unprovability.-a rCa (G||del 1931:40-41) >>>>>>>>>>>
    G asserts its own unprovability.

    G asserts that there are no sequence of inference
    steps that prove that they themselves do not exist.

    No, G asserts, by its interpretation in M, a meta-system of F >>>>>>>>>> with additional axioms, that there exist no FINITE sequence of >>>>>>>>>> inference steps IN F that prove the statement G.


    That is not what G itself says. That is merely the
    extra baggage of one man's way of examining G.

    RIght, G itself say that there exsits no number that


    The barest essence of G is:
    G asserts its own unprovability.

    Nope, that it the INTERPRETATION of G, which can only be seen in >>>>>>>> the meta system.

    The barest essential of G is what G actually says, which is that >>>>>>>> no number g exist that meets the requirements of that given
    relationship.


    The barest essence of that English sentence
    taken in isolation: G asserts its own unprovability.


    You don't seem to understand that you can't take sentences out of >>>>>> context and understand what they mean.


    You don't understand that it still
    retains the compositional meaning
    of the meaning of its words.

    An the meaning of the words are based on the context.


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

    Right, The assertion is in M
    The unprovability is in F

    Noting inconsistant with that, as M is more powerful than F

    Your stupidity is amazing.

    You really have burnt out your brain by your self-brainwashing.


    In semantics, mathematical logic and related disciplines,
    the principle of compositionality is the principle that
    the meaning of a complex expression is determined by the
    meanings of its constituent expressions and the rules
    used to combine them. The principle is also called
    Frege's principle, because Gottlob Frege is widely
    credited for the first modern formulation of it.

    But, the statement yo are looking at isn't a statement of mathematical
    riger, but a Natural Language explamation of a result.


    That is why I created Minimal Type Theory https://philarchive.org/archive/PETMTT-4v2\
    G := ~Provable(G)

    So, what does your theory have to do with what a senctence, not written
    in your theory actually means?


    G asserts its own unprovability.

    ONLY under the interpretation of the Meta system.


    which semantically entails

    G asserts that there are no sequence of inference
    steps that prove that they themselves do not exist.

    Not quite.

    G asserts (in the interpreation of it in the Meta syastem) that there is
    no FINTE sequence of infernence steps IN THE BASE SYSTEM that proves it
    to be true.

    There ARE an infinite sequnce of steps in the base system, and a finite sequence of steps in the meta system that show it is True.

    All you are doing is proving your "Minimal Type Theory" is just
    incorrect in you application here.

    And that is largely because you show you don't understand how language
    or logic actually work.

    Your concept of semantics is broken, as you don't let words mean what
    they actually mean in ther context, because in your world every thing collapses to the same thing, as everything is the same, but also
    differnt because you view of reality is just broken by your insanity,


    The ACTUAL statement, mentioned prior in the discussion, does
    precisely give the mathematical meaning, and then Godel, to help the
    reader understand what that says, translates it to a simple Natural
    Language statement.

    Again, your problem is you just don't understand how context works,
    and don't see what parts in the paper are Formal statements, and what
    parts are the Natural Language explainations.

    All you are doing by trying to invoke that principle is to demonstrate
    you don't know what you, or it, is talking about.

    For instance, the word "proposition" in this context references the
    INTERPREATION of G in M, and the "unprovability" reference that
    property in F. These meanings come from the CONTEXT which affect the
    meaning of words of Natural Language.

    Note, that his Formal Statements use mathematical notation, while this
    statement does not, thus is clearly a Natural Language statement to be
    interpreted by the "rules" of Natural Language.


    https://en.wikipedia.org/wiki/Principle_of_compositionality
    Context is an entirely different thing.


    I guess you are just proving that you are just too stupid to
    understand the basics of communication, or sematics.











    --- Synchronet 3.21a-Linux NewsLink 1.2