Rocksolid Light

Welcome to RetroBBS

mail  files  register  newsreader  groups  login

Message-ID:  

"If that makes any sense to you, you have a big problem." -- C. Durance, Computer Science 234


computers / comp.ai.philosophy / Re: Gödel's proof relies on self-contradictory expressions of language

SubjectAuthor
* Gödel's proof relies on self-contradictory expressolcott
`* Re: Gödel's proof relies on self-contradictory eRichard Damon
 +* Re: Gödel's proof relies on self-contradictory eolcott
 |`* Re: Gödel's proof relies on self-contradictory eRichard Damon
 | `* Re: Gödel's proof relies on self-contradictory eolcott
 |  `- Re: Gödel's proof relies on self-contradictory eRichard Damon
 `* Re: Gödel's proof relies on self-contradictory eolcott
  `* Re: Gödel's proof relies on self-contradictory eRichard Damon
   `* Re: Gödel's proof relies on self-contradictory eolcott
    +- Re: Gödel's proof relies on self-contradictory exprDon Stockbauer
    `* Re: Gödel's proof relies on self-contradictory eRichard Damon
     `* Re: Gödel's proof relies on self-contradictory eolcott
      `* Re: Gödel's proof relies on self-contradictory eRichard Damon
       `* Re: Gödel's proof relies on self-contradictory eolcott
        `* Re: Gödel's proof relies on self-contradictory eRichard Damon
         `* Re: Gödel's proof relies on self-contradictory eolcott
          `* Re: Gödel's proof relies on self-contradictory eRichard Damon
           `* Re: Gödel's proof relies on self-contradictory eolcott
            `* Re: Gödel's proof relies on self-contradictory eRichard Damon
             `* Re: Gödel's proof relies on self-contradictory eolcott
              `* Re: Gödel's proof relies on self-contradictory eRichard Damon
               +* Re: Gödel's proof relies on self-contradictory eolcott
               |`* Re: Gödel's proof relies on self-contradictory eRichard Damon
               | `* Re: Gödel's proof relies on self-contradictory eolcott
               |  `* Re: Gödel's proof relies on self-contradictory eRichard Damon
               |   `* Re: Gödel's proof relies on self-contradictory eolcott
               |    `* Re: Gödel's proof relies on self-contradictory eRichard Damon
               |     `* Re: Gödel's proof relies on self-contradictory eolcott
               |      `* Re: Gödel's proof relies on self-contradictory eRichard Damon
               |       `* Re: Gödel's proof relies on self-contradictory eolcott
               |        +- Re: Gödel's proof relies on self-contradictory exprDon Stockbauer
               |        `* Re: Gödel's proof relies on self-contradictory eRichard Damon
               |         `* Re: Gödel's proof relies on self-contradictory eolcott
               |          `* Re: Gödel's proof relies on self-contradictory eRichard Damon
               |           +* Re: Gödel's proof relies on self-contradictory eolcott
               |           |`* Re: Gödel's proof relies on self-contradictory eRichard Damon
               |           | `* Re: Gödel's proof relies on self-contradictory eolcott
               |           |  +- Re: Gödel's proof relies on self-contradictory eRichard Damon
               |           |  `- Re: Gödel's proof relies on self-contradictory eRichard Damon
               |           `* Re: Gödel's proof relies on self-contradictory eolcott
               |            `* Re: Gödel's proof relies on self-contradictory eRichard Damon
               |             `* Re: Gödel's proof relies on self-contradictory eolcott
               |              `* Re: Gödel's proof relies on self-contradictory eRichard Damon
               |               `* Re: Gödel's proof relies on self-contradictory eolcott
               |                `- Re: Gödel's proof relies on self-contradictory eRichard Damon
               `* Re: Gödel's proof relies on self-contradictory eolcott
                `* Re: Gödel's proof relies on self-contradictory eRichard Damon
                 `* Re: Gödel's proof relies on self-contradictory eolcott
                  `- Re: Gödel's proof relies on self-contradictory eRichard Damon

Pages:12
Re: Gödel's proof relies on self-contradictory expressions of language

<u3it56$147a9$2@dont-email.me>

  copy mid

https://www.rocksolidbbs.com/computers/article-flat.php?id=11131&group=comp.ai.philosophy#11131

  copy link   Newsgroups: comp.theory sci.logic comp.ai.philosophy
Path: i2pn2.org!i2pn.org!eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail
From: polcott2@gmail.com (olcott)
Newsgroups: comp.theory,sci.logic,comp.ai.philosophy
Subject: Re:_Gödel's_proof_relies_on_self-contradictory_e
xpressions_of_language
Date: Thu, 11 May 2023 09:12:53 -0500
Organization: A noiseless patient Spider
Lines: 41
Message-ID: <u3it56$147a9$2@dont-email.me>
References: <u38nv6$3f467$1@dont-email.me> <irT5M.569994$5S78.431405@fx48.iad>
<u39qvj$3op8a$1@dont-email.me> <Xr56M.1703155$t5W7.1583576@fx13.iad>
<u3b5tt$3trvp$1@dont-email.me> <_sf6M.2705468$iU59.867750@fx14.iad>
<u3cbr5$5cs1$1@dont-email.me> <9mq6M.361324$rKDc.18371@fx34.iad>
<u3dr6t$adhk$1@dont-email.me> <XXz6M.596198$5CY7.189218@fx46.iad>
<u3ens7$dmlj$1@dont-email.me> <zsC6M.420575$ZnFc.164439@fx41.iad>
<u3f0i6$i6bm$1@dont-email.me> <o9L6M.2991409$vBI8.2430455@fx15.iad>
<u3g9k5$n2jk$1@dont-email.me> <6NV6M.362445$rKDc.280133@fx34.iad>
<u3hlqk$vv0u$1@dont-email.me> <1s47M.2759161$iU59.1670171@fx14.iad>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Thu, 11 May 2023 14:12:55 -0000 (UTC)
Injection-Info: dont-email.me; posting-host="5cdc38fcaa4f12c1661fbbe9f7a58b09";
logging-data="1187145"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX19B5R6rAVmi5eP2ptLch3yK"
User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:102.0) Gecko/20100101
Thunderbird/102.10.1
Cancel-Lock: sha1:lHKSvLIQ6YPRv5q5GVsHxM3juI0=
In-Reply-To: <1s47M.2759161$iU59.1670171@fx14.iad>
Content-Language: en-US
 by: olcott - Thu, 11 May 2023 14:12 UTC

On 5/11/2023 6:37 AM, Richard Damon wrote:
> On 5/10/23 11:01 PM, olcott wrote:
>> On 5/10/2023 6:29 PM, Richard Damon wrote:
>
>>>>
>>>> Gödel, Kurt 1931.
>>>> On Formally Undecidable Propositions of Principia Mathematica And
>>>> Related Systems
>>>>
>>>> https://mavdisk.mnsu.edu/pj2943kt/Fall%202015/Promotion%20Application/Previous%20Years%20Article%2022%20Materials/godel-1931.pdf
>>>>
>>>> Since Tarski directly stated that he is anchoring his comparable proof
>>>> in the actual Liar Paradox I have provided sufficient support for my
>>>> position.
>>>>
>>>
>>> Nope, In fact, he is using the non-truth bearing of the Liars Paradox
>>> for his proof,
>>>
>>
>> I say that Tarski is using the Liar Paradox as the basis of his proof
>> and you say no I am wrong the truth is that Tarski is using the Liar
>> Paradox as the basis of his proof?
>>
>
> YOU have been saying that because Tarski, erroneosly, finds that logic
> can't prove the liar's paradox, his proof must be wrong, i.e  there is
> no definition of Truth.
>
>
> I say that his proof shows that if a Definition of Truth (meaning a
> determinate procedure to determine if any statement is true or false)
> existed, then it would be possible to prove that the liar's paradox is a
> true statement,

Where did you get that nutty idea?

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

Re: Gödel's proof relies on self-contradictory expressions of language

<u3iu8h$14bso$1@dont-email.me>

  copy mid

https://www.rocksolidbbs.com/computers/article-flat.php?id=11132&group=comp.ai.philosophy#11132

  copy link   Newsgroups: comp.theory sci.logic comp.ai.philosophy
Path: i2pn2.org!i2pn.org!eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail
From: polcott2@gmail.com (olcott)
Newsgroups: comp.theory,sci.logic,comp.ai.philosophy
Subject: Re:_Gödel's_proof_relies_on_self-contradictory_e
xpressions_of_language
Date: Thu, 11 May 2023 09:31:43 -0500
Organization: A noiseless patient Spider
Lines: 114
Message-ID: <u3iu8h$14bso$1@dont-email.me>
References: <u38nv6$3f467$1@dont-email.me> <irT5M.569994$5S78.431405@fx48.iad>
<u39qvj$3op8a$1@dont-email.me> <Xr56M.1703155$t5W7.1583576@fx13.iad>
<u3b5tt$3trvp$1@dont-email.me> <_sf6M.2705468$iU59.867750@fx14.iad>
<u3cbr5$5cs1$1@dont-email.me> <9mq6M.361324$rKDc.18371@fx34.iad>
<u3dr6t$adhk$1@dont-email.me> <XXz6M.596198$5CY7.189218@fx46.iad>
<u3ens7$dmlj$1@dont-email.me> <zsC6M.420575$ZnFc.164439@fx41.iad>
<u3f0i6$i6bm$1@dont-email.me> <o9L6M.2991409$vBI8.2430455@fx15.iad>
<u3g9k5$n2jk$1@dont-email.me> <6NV6M.362445$rKDc.280133@fx34.iad>
<u3hm7v$vv0u$2@dont-email.me> <3s47M.2759162$iU59.563487@fx14.iad>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Thu, 11 May 2023 14:31:45 -0000 (UTC)
Injection-Info: dont-email.me; posting-host="5cdc38fcaa4f12c1661fbbe9f7a58b09";
logging-data="1191832"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1/EoIwKOHV+9IoVyJtsF1gL"
User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:102.0) Gecko/20100101
Thunderbird/102.10.1
Cancel-Lock: sha1:K6407ff0UKtxtvCjZ3V3D1taeIE=
Content-Language: en-US
In-Reply-To: <3s47M.2759162$iU59.563487@fx14.iad>
 by: olcott - Thu, 11 May 2023 14:31 UTC

On 5/11/2023 6:37 AM, Richard Damon wrote:
> On 5/10/23 11:08 PM, olcott wrote:
>> On 5/10/2023 6:29 PM, Richard Damon wrote:
>>> On 5/10/23 10:27 AM, olcott wrote:
>>>> On 5/10/2023 6:24 AM, Richard Damon wrote:
>>>>> On 5/9/23 10:46 PM, olcott wrote:
>>>>>> On 5/9/2023 8:30 PM, Richard Damon wrote:
>>>>>>> On 5/9/23 8:18 PM, olcott wrote:
>>>>>>
>>>>>>>> Gödel intended his actual G to be isomorphic to the above self-
>>>>>>>> referential expression.
>>>>>>>
>>>>>>> Nope, you are over-simplifying things.
>>>>>>
>>>>>> Not at all. I boiled them down to their barest essence. Gödel's G was
>>>>>> intended to be and is isomorphic to a self-contradictory expression.
>>>>>>
>>>>>> This is dead obvious in Tarski's comparable proof where he flat out
>>>>>> states that he is anchoring his proof in the actual Liar Paradox.
>>>>>>
>>>>>>
>>>>>
>>>>> So, you are just PROVING that you don't understand how logic
>>>>> actually works and are falling for your own Straw man Error.
>>>>>
>>>>
>>>> No I am proving to have a deeper understanding of these things than
>>>> most
>>>> others have.
>>>
>>> Nope, just that you are so dumb you don't know what you don't
>>> understand.
>>>
>> I say that incorrectly. I have a deeper understanding OF THE ESSENCE OF
>> HIS PROOF. It is commonly understood that Gödel's actual proof is
>> isomorphic to {a proposition which asserts its own unprovability}. It is
>> also commonly understood that this is self-contradictory.
>>
>> What is not commonly understood is that formal systems that cannot prove
>> self-contradictory expressions are not in any way deficient.
>>
>
> But that isn't what his proof is about,
>
> You just have a deeper MISunderstanding of what he is saying because you
> don't understand what he is saying at all, but are just trying to
> understand the altered strawman arguement that you think you can
> understand,
>
> YOU FAIL.
>
> None of thes proofs are about a system being deficient for not being
> able to resolve a self-contradictory statement or a non-truth-bearer.
> The fact you think they are just shows that you are misunderstanding the
> proofs.
>
> Godel shows a statement, THAT IS TRUE, (and thus CAN'T be
> self-contradictory) that can not be proven in that system. This meets
> the DEFINTION of "Incompleteness" in Logic.
>

He does this in the same way that this Liar Paradox is true:
This sentence is not true: "This sentence is not true"

It is not that the actual Liar Paradox is true it is only when the Liar
Paradox is applied to itself that it becomes true.

G states that it is unprovable in F and is unprovable in F because it is
self-contradictory in F.

When we test the same statement in metamathematics then it becomes true
because it escapes the self-contradiction the same way that the above
Liar Paradox escaped the self-contradiction.

The prerequisite to attaining this much deeper understanding of the
essence of Gödel's proof is
(1) Understanding that Gödel's G was intended to be and is isomorphic to
{a proposition which asserts its own unprovability [in PM]}

(2) Thus making Gödel's G isomorphic to a self-contradictory expression.

> Tarski shows that there are some statements, that have a truth value,
> that we can not know that truth value, because the mere existance of a
> "Definition" (deterministic method) to test them with leads to the
> contradiction that the Liar's Paradox must be True..
>

When you understand the essence of his proof you will understand that
Tarski's metatheory is merely applying the Liar Paradox to itself
outside of the scope of self-contradiction.

"This sentence is not true" is not a truth bearer.
This sentence is not true: "This sentence is not true" is true because
the inner sentence is not a truth bearer.

> The problem isn't that he expects that a system should be able to
> resolve the Liar's Paradox, but that a "Definition of Truth" leads to a
> claimed resolution, namely that the Liar's Paradox IS True (which means
> it also must be False). He shows that a "Definition of Truth" turns the
> Liar's Paradox from a non-truth-bearer into a Truth Bearer that is True
> (and thus also False).
>
> Your failure to understand this just shows your stupidity.
>

In this case it was Tarski's failure to understand.
Only when we boil things down to their barest essence (as I have had to
do as a software engineer for almost four decades) do we see these
things in their true light.

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

Re: Gödel's proof relies on self-contradictory expressions of language

<quh7M.3034951$vBI8.187696@fx15.iad>

  copy mid

https://www.rocksolidbbs.com/computers/article-flat.php?id=11133&group=comp.ai.philosophy#11133

  copy link   Newsgroups: comp.theory sci.logic comp.ai.philosophy
Path: i2pn2.org!i2pn.org!usenet.blueworldhosting.com!diablo1.usenet.blueworldhosting.com!peer03.iad!feed-me.highwinds-media.com!news.highwinds-media.com!fx15.iad.POSTED!not-for-mail
MIME-Version: 1.0
User-Agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10.15; rv:102.0)
Gecko/20100101 Thunderbird/102.11.0
Subject: Re:_Gödel's_proof_relies_on_self-contradictory_e
xpressions_of_language
Content-Language: en-US
Newsgroups: comp.theory,sci.logic,comp.ai.philosophy
References: <u38nv6$3f467$1@dont-email.me> <irT5M.569994$5S78.431405@fx48.iad>
<u39qvj$3op8a$1@dont-email.me> <Xr56M.1703155$t5W7.1583576@fx13.iad>
<u3b5tt$3trvp$1@dont-email.me> <_sf6M.2705468$iU59.867750@fx14.iad>
<u3cbr5$5cs1$1@dont-email.me> <9mq6M.361324$rKDc.18371@fx34.iad>
<u3dr6t$adhk$1@dont-email.me> <XXz6M.596198$5CY7.189218@fx46.iad>
<u3ens7$dmlj$1@dont-email.me> <zsC6M.420575$ZnFc.164439@fx41.iad>
<u3f0i6$i6bm$1@dont-email.me> <o9L6M.2991409$vBI8.2430455@fx15.iad>
<u3g9k5$n2jk$1@dont-email.me> <6NV6M.362445$rKDc.280133@fx34.iad>
<u3hlqk$vv0u$1@dont-email.me> <1s47M.2759161$iU59.1670171@fx14.iad>
<u3it56$147a9$2@dont-email.me>
From: Richard@Damon-Family.org (Richard Damon)
In-Reply-To: <u3it56$147a9$2@dont-email.me>
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Lines: 61
Message-ID: <quh7M.3034951$vBI8.187696@fx15.iad>
X-Complaints-To: abuse@easynews.com
Organization: Forte - www.forteinc.com
X-Complaints-Info: Please be sure to forward a copy of ALL headers otherwise we will be unable to process your complaint properly.
Date: Thu, 11 May 2023 22:27:35 -0400
X-Received-Bytes: 3682
 by: Richard Damon - Fri, 12 May 2023 02:27 UTC

On 5/11/23 10:12 AM, olcott wrote:
> On 5/11/2023 6:37 AM, Richard Damon wrote:
>> On 5/10/23 11:01 PM, olcott wrote:
>>> On 5/10/2023 6:29 PM, Richard Damon wrote:
>>
>>>>>
>>>>> Gödel, Kurt 1931.
>>>>> On Formally Undecidable Propositions of Principia Mathematica And
>>>>> Related Systems
>>>>>
>>>>> https://mavdisk.mnsu.edu/pj2943kt/Fall%202015/Promotion%20Application/Previous%20Years%20Article%2022%20Materials/godel-1931.pdf
>>>>>
>>>>> Since Tarski directly stated that he is anchoring his comparable proof
>>>>> in the actual Liar Paradox I have provided sufficient support for my
>>>>> position.
>>>>>
>>>>
>>>> Nope, In fact, he is using the non-truth bearing of the Liars
>>>> Paradox for his proof,
>>>>
>>>
>>> I say that Tarski is using the Liar Paradox as the basis of his proof
>>> and you say no I am wrong the truth is that Tarski is using the Liar
>>> Paradox as the basis of his proof?
>>>
>>
>> YOU have been saying that because Tarski, erroneosly, finds that logic
>> can't prove the liar's paradox, his proof must be wrong, i.e  there is
>> no definition of Truth.
>>
>>
>> I say that his proof shows that if a Definition of Truth (meaning a
>> determinate procedure to determine if any statement is true or false)
>> existed, then it would be possible to prove that the liar's paradox is
>> a true statement,
>
> Where did you get that nutty idea?
>

FROM HIS PROOF!

He first does a lot of work to establish a number of properties.

He then makes a trial assumption that there could be a "Definition of
Truth" per his meaning.

He then goes through a few logical steps, and comes out with a proof
that the Liar's Paradox is True, given the assumption of a Definition of
Truth.

Since he knows this is impossible, he concludes that there can not be a
"Defintion of Truth".

You can't see that in his proof?

of course, your "reducing things to there essentials" which requires you
changing the meaning of things problably obliterates that part of the logic.

I can't help that you are too ignorant and stupid to understand what he
is saying.

Re: Gödel's proof relies on self-contradictory expressions of language

<tuh7M.3034952$vBI8.1644717@fx15.iad>

  copy mid

https://www.rocksolidbbs.com/computers/article-flat.php?id=11134&group=comp.ai.philosophy#11134

  copy link   Newsgroups: comp.theory sci.logic comp.ai.philosophy
Path: i2pn2.org!i2pn.org!usenet.blueworldhosting.com!diablo1.usenet.blueworldhosting.com!peer02.iad!feed-me.highwinds-media.com!news.highwinds-media.com!fx15.iad.POSTED!not-for-mail
MIME-Version: 1.0
User-Agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10.15; rv:102.0)
Gecko/20100101 Thunderbird/102.11.0
Subject: Re:_Gödel's_proof_relies_on_self-contradictory_e
xpressions_of_language
Content-Language: en-US
Newsgroups: comp.theory,sci.logic,comp.ai.philosophy
References: <u38nv6$3f467$1@dont-email.me> <irT5M.569994$5S78.431405@fx48.iad>
<u39qvj$3op8a$1@dont-email.me> <Xr56M.1703155$t5W7.1583576@fx13.iad>
<u3b5tt$3trvp$1@dont-email.me> <_sf6M.2705468$iU59.867750@fx14.iad>
<u3cbr5$5cs1$1@dont-email.me> <9mq6M.361324$rKDc.18371@fx34.iad>
<u3dr6t$adhk$1@dont-email.me> <XXz6M.596198$5CY7.189218@fx46.iad>
<u3ens7$dmlj$1@dont-email.me> <zsC6M.420575$ZnFc.164439@fx41.iad>
<u3f0i6$i6bm$1@dont-email.me> <o9L6M.2991409$vBI8.2430455@fx15.iad>
<u3g9k5$n2jk$1@dont-email.me> <6NV6M.362445$rKDc.280133@fx34.iad>
<u3hm7v$vv0u$2@dont-email.me> <3s47M.2759162$iU59.563487@fx14.iad>
<u3iu8h$14bso$1@dont-email.me>
From: Richard@Damon-Family.org (Richard Damon)
In-Reply-To: <u3iu8h$14bso$1@dont-email.me>
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Lines: 162
Message-ID: <tuh7M.3034952$vBI8.1644717@fx15.iad>
X-Complaints-To: abuse@easynews.com
Organization: Forte - www.forteinc.com
X-Complaints-Info: Please be sure to forward a copy of ALL headers otherwise we will be unable to process your complaint properly.
Date: Thu, 11 May 2023 22:27:37 -0400
X-Received-Bytes: 7623
 by: Richard Damon - Fri, 12 May 2023 02:27 UTC

On 5/11/23 10:31 AM, olcott wrote:
> On 5/11/2023 6:37 AM, Richard Damon wrote:
>> On 5/10/23 11:08 PM, olcott wrote:
>>> On 5/10/2023 6:29 PM, Richard Damon wrote:
>>>> On 5/10/23 10:27 AM, olcott wrote:
>>>>> On 5/10/2023 6:24 AM, Richard Damon wrote:
>>>>>> On 5/9/23 10:46 PM, olcott wrote:
>>>>>>> On 5/9/2023 8:30 PM, Richard Damon wrote:
>>>>>>>> On 5/9/23 8:18 PM, olcott wrote:
>>>>>>>
>>>>>>>>> Gödel intended his actual G to be isomorphic to the above self-
>>>>>>>>> referential expression.
>>>>>>>>
>>>>>>>> Nope, you are over-simplifying things.
>>>>>>>
>>>>>>> Not at all. I boiled them down to their barest essence. Gödel's G
>>>>>>> was
>>>>>>> intended to be and is isomorphic to a self-contradictory expression.
>>>>>>>
>>>>>>> This is dead obvious in Tarski's comparable proof where he flat out
>>>>>>> states that he is anchoring his proof in the actual Liar Paradox.
>>>>>>>
>>>>>>>
>>>>>>
>>>>>> So, you are just PROVING that you don't understand how logic
>>>>>> actually works and are falling for your own Straw man Error.
>>>>>>
>>>>>
>>>>> No I am proving to have a deeper understanding of these things than
>>>>> most
>>>>> others have.
>>>>
>>>> Nope, just that you are so dumb you don't know what you don't
>>>> understand.
>>>>
>>> I say that incorrectly. I have a deeper understanding OF THE ESSENCE OF
>>> HIS PROOF. It is commonly understood that Gödel's actual proof is
>>> isomorphic to {a proposition which asserts its own unprovability}. It is
>>> also commonly understood that this is self-contradictory.
>>>
>>> What is not commonly understood is that formal systems that cannot prove
>>> self-contradictory expressions are not in any way deficient.
>>>
>>
>> But that isn't what his proof is about,
>>
>> You just have a deeper MISunderstanding of what he is saying because
>> you don't understand what he is saying at all, but are just trying to
>> understand the altered strawman arguement that you think you can
>> understand,
>>
>> YOU FAIL.
>>
>> None of thes proofs are about a system being deficient for not being
>> able to resolve a self-contradictory statement or a non-truth-bearer.
>> The fact you think they are just shows that you are misunderstanding
>> the proofs.
>>
>> Godel shows a statement, THAT IS TRUE, (and thus CAN'T be
>> self-contradictory) that can not be proven in that system. This meets
>> the DEFINTION of "Incompleteness" in Logic.
>>
>
> He does this in the same way that this Liar Paradox is true:
> This sentence is not true: "This sentence is not true"

Nope.

The statement is that "there exists no natural number that satisfies a
particular primative recursive relationship". No natural number
satisifies that relationship, so the statment is TRUE.

Are you claiming that a statement that actually matches what is might
not be true? or that a statment which you claim to have a different
truth value can actually be isomorphic with the original (how is it
isomorphic then?)

>
> It is not that the actual Liar Paradox is true it is only when the Liar
> Paradox is applied to itself that it becomes true.

So?

>
> G states that it is unprovable in F and is unprovable in F because it is
> self-contradictory in F.

Nope. And you insistance of that just shows you are a pathological liar,
as it has been pointed out that this is NOT what G says, but you are too
stupid to understand that.

Note, the statement that G is unprovable in F, is a statement that is
DERIVED for G, but ONLY in the Meta Theory.

>
> When we test the same statement in metamathematics then it becomes true
> because it escapes the self-contradiction the same way that the above
> Liar Paradox escaped the self-contradiction.

Which means it never was self-contradictory, showing how stupid you are.

>
> The prerequisite to attaining this much deeper understanding of the
> essence of Gödel's proof is
> (1) Understanding that Gödel's G was intended to be and is isomorphic to
>     {a proposition which asserts its own unprovability [in PM]}

Nope.

>
> (2) Thus making Gödel's G isomorphic to a self-contradictory expression.

So, the basis of your method of attaining deeped understanding of the
essense of a statement is to study a Strawman and derive unsond and
false conclusion,

Sounds about right for you.

>
>> Tarski shows that there are some statements, that have a truth value,
>> that we can not know that truth value, because the mere existance of a
>> "Definition" (deterministic method) to test them with leads to the
>> contradiction that the Liar's Paradox must be True..
>>
>
> When you understand the essence of his proof you will understand that
> Tarski's metatheory is merely applying the Liar Paradox to itself
> outside of the scope of self-contradiction.

Nope, just shows your stupidity.

>
> "This sentence is not true" is not a truth bearer.
> This sentence is not true: "This sentence is not true" is true because
> the inner sentence is not a truth bearer.

Which isn't what he did, so irrelevent.

You are just showing your inability to understand a sound logical arguement.

>
>> The problem isn't that he expects that a system should be able to
>> resolve the Liar's Paradox, but that a "Definition of Truth" leads to
>> a claimed resolution, namely that the Liar's Paradox IS True (which
>> means it also must be False). He shows that a "Definition of Truth"
>> turns the Liar's Paradox from a non-truth-bearer into a Truth Bearer
>> that is True (and thus also False).
>>
>> Your failure to understand this just shows your stupidity.
>>
>
> In this case it was Tarski's failure to understand.
> Only when we boil things down to their barest essence (as I have had to
> do as a software engineer for almost four decades) do we see these
> things in their true light.
>

Nope, it is YOUR failure to understand what any of the words actually mean.

YOU ARE PROVING YOUR OWN STUPIDITY.

Re: Gödel's proof relies on self-contradictory expressions of language

<u3k8it$1clv7$1@dont-email.me>

  copy mid

https://www.rocksolidbbs.com/computers/article-flat.php?id=11136&group=comp.ai.philosophy#11136

  copy link   Newsgroups: comp.theory sci.logic comp.ai.philosophy
Path: i2pn2.org!i2pn.org!eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail
From: polcott2@gmail.com (olcott)
Newsgroups: comp.theory,sci.logic,comp.ai.philosophy
Subject: Re:_Gödel's_proof_relies_on_self-contradictory_e
xpressions_of_language
Date: Thu, 11 May 2023 21:34:05 -0500
Organization: A noiseless patient Spider
Lines: 52
Message-ID: <u3k8it$1clv7$1@dont-email.me>
References: <u38nv6$3f467$1@dont-email.me> <irT5M.569994$5S78.431405@fx48.iad>
<u39qvj$3op8a$1@dont-email.me> <Xr56M.1703155$t5W7.1583576@fx13.iad>
<u3b5tt$3trvp$1@dont-email.me> <_sf6M.2705468$iU59.867750@fx14.iad>
<u3cbr5$5cs1$1@dont-email.me> <9mq6M.361324$rKDc.18371@fx34.iad>
<u3dr6t$adhk$1@dont-email.me> <XXz6M.596198$5CY7.189218@fx46.iad>
<u3ens7$dmlj$1@dont-email.me> <zsC6M.420575$ZnFc.164439@fx41.iad>
<u3f0i6$i6bm$1@dont-email.me> <o9L6M.2991409$vBI8.2430455@fx15.iad>
<u3g9k5$n2jk$1@dont-email.me> <6NV6M.362445$rKDc.280133@fx34.iad>
<u3hlqk$vv0u$1@dont-email.me> <1s47M.2759161$iU59.1670171@fx14.iad>
<u3it56$147a9$2@dont-email.me> <quh7M.3034951$vBI8.187696@fx15.iad>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Fri, 12 May 2023 02:34:05 -0000 (UTC)
Injection-Info: dont-email.me; posting-host="007f3be39fcbbc123c7883d64b532583";
logging-data="1464295"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1+KvdqBfpHO6QUTLOUz7FV4"
User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:102.0) Gecko/20100101
Thunderbird/102.10.1
Cancel-Lock: sha1:9fWWfySNbM7bTfGga/9vb3NtSBY=
In-Reply-To: <quh7M.3034951$vBI8.187696@fx15.iad>
Content-Language: en-US
 by: olcott - Fri, 12 May 2023 02:34 UTC

On 5/11/2023 9:27 PM, Richard Damon wrote:
> On 5/11/23 10:12 AM, olcott wrote:
>> On 5/11/2023 6:37 AM, Richard Damon wrote:
>>> On 5/10/23 11:01 PM, olcott wrote:
>>>> On 5/10/2023 6:29 PM, Richard Damon wrote:
>>>
>>>>>>
>>>>>> Gödel, Kurt 1931.
>>>>>> On Formally Undecidable Propositions of Principia Mathematica And
>>>>>> Related Systems
>>>>>>
>>>>>> https://mavdisk.mnsu.edu/pj2943kt/Fall%202015/Promotion%20Application/Previous%20Years%20Article%2022%20Materials/godel-1931.pdf
>>>>>>
>>>>>> Since Tarski directly stated that he is anchoring his comparable
>>>>>> proof
>>>>>> in the actual Liar Paradox I have provided sufficient support for my
>>>>>> position.
>>>>>>
>>>>>
>>>>> Nope, In fact, he is using the non-truth bearing of the Liars
>>>>> Paradox for his proof,
>>>>>
>>>>
>>>> I say that Tarski is using the Liar Paradox as the basis of his
>>>> proof and you say no I am wrong the truth is that Tarski is using
>>>> the Liar Paradox as the basis of his proof?
>>>>
>>>
>>> YOU have been saying that because Tarski, erroneosly, finds that
>>> logic can't prove the liar's paradox, his proof must be wrong, i.e
>>> there is no definition of Truth.
>>>
>>>
>>> I say that his proof shows that if a Definition of Truth (meaning a
>>> determinate procedure to determine if any statement is true or false)
>>> existed, then it would be possible to prove that the liar's paradox
>>> is a true statement,
>>
>> Where did you get that nutty idea?
>>
>
> FROM HIS PROOF!
>
> He first does a lot of work to establish a number of properties.
In other words you agree that Tarski did "prove" that the notion of
Truth cannot be fully formalized on a fundamental basis directly related
to the Liar Paradox?

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

Re: Gödel's proof relies on self-contradictory expressions of language

<LTh7M.1811499$MVg8.828957@fx12.iad>

  copy mid

https://www.rocksolidbbs.com/computers/article-flat.php?id=11137&group=comp.ai.philosophy#11137

  copy link   Newsgroups: comp.theory sci.logic comp.ai.philosophy
Path: i2pn2.org!i2pn.org!usenet.blueworldhosting.com!diablo1.usenet.blueworldhosting.com!peer03.iad!feed-me.highwinds-media.com!news.highwinds-media.com!fx12.iad.POSTED!not-for-mail
MIME-Version: 1.0
User-Agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10.15; rv:102.0)
Gecko/20100101 Thunderbird/102.11.0
Subject: Re:_Gödel's_proof_relies_on_self-contradictory_e
xpressions_of_language
Content-Language: en-US
Newsgroups: comp.theory,sci.logic,comp.ai.philosophy
References: <u38nv6$3f467$1@dont-email.me> <irT5M.569994$5S78.431405@fx48.iad>
<u39qvj$3op8a$1@dont-email.me> <Xr56M.1703155$t5W7.1583576@fx13.iad>
<u3b5tt$3trvp$1@dont-email.me> <_sf6M.2705468$iU59.867750@fx14.iad>
<u3cbr5$5cs1$1@dont-email.me> <9mq6M.361324$rKDc.18371@fx34.iad>
<u3dr6t$adhk$1@dont-email.me> <XXz6M.596198$5CY7.189218@fx46.iad>
<u3ens7$dmlj$1@dont-email.me> <zsC6M.420575$ZnFc.164439@fx41.iad>
<u3f0i6$i6bm$1@dont-email.me> <o9L6M.2991409$vBI8.2430455@fx15.iad>
<u3g9k5$n2jk$1@dont-email.me> <6NV6M.362445$rKDc.280133@fx34.iad>
<u3hlqk$vv0u$1@dont-email.me> <1s47M.2759161$iU59.1670171@fx14.iad>
<u3it56$147a9$2@dont-email.me> <quh7M.3034951$vBI8.187696@fx15.iad>
<u3k8it$1clv7$1@dont-email.me>
From: Richard@Damon-Family.org (Richard Damon)
In-Reply-To: <u3k8it$1clv7$1@dont-email.me>
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 7bit
Lines: 26
Message-ID: <LTh7M.1811499$MVg8.828957@fx12.iad>
X-Complaints-To: abuse@easynews.com
Organization: Forte - www.forteinc.com
X-Complaints-Info: Please be sure to forward a copy of ALL headers otherwise we will be unable to process your complaint properly.
Date: Thu, 11 May 2023 22:54:35 -0400
X-Received-Bytes: 2749
 by: Richard Damon - Fri, 12 May 2023 02:54 UTC

On 5/11/23 10:34 PM, olcott wrote:

>> FROM HIS PROOF!
>>
>> He first does a lot of work to establish a number of properties.
> In other words you agree that Tarski did "prove" that the notion of
> Truth cannot be fully formalized on a fundamental basis directly related
> to the Liar Paradox?
>

Only in the sense that since we KNOW the Liar's paradox can't be true,
and a "Definition of Truth" (not a "notion of Truth) would lead to being
able to prove that the Liar's paradox is true,

This isn't what most people would consider proving using as a basis, as
that normally means proving something because the basis is true.

Also, your use of the word "Notion" seems to indicate that you really
don't understand what Tarski was even talking about. It isn't that we
don't know the nature of Truth, and he goes into a lot of explanation of
a lot of the nature of Truth, but we can't come up with a formulaic
"Definition" that we can use to "test" an arbitrary statement to
determine if it is True or not.

This just goes back to your utter lack of understanding of anything that
these people are talking about.

Re: Gödel's proof relies on self-contradictory expressions of language

<u3kbsp$1d3i2$1@dont-email.me>

  copy mid

https://www.rocksolidbbs.com/computers/article-flat.php?id=11138&group=comp.ai.philosophy#11138

  copy link   Newsgroups: comp.theory sci.logic comp.ai.philosophy
Path: i2pn2.org!i2pn.org!eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail
From: polcott2@gmail.com (olcott)
Newsgroups: comp.theory,sci.logic,comp.ai.philosophy
Subject: Re:_Gödel's_proof_relies_on_self-contradictory_e
xpressions_of_language
Date: Thu, 11 May 2023 22:30:32 -0500
Organization: A noiseless patient Spider
Lines: 23
Message-ID: <u3kbsp$1d3i2$1@dont-email.me>
References: <u38nv6$3f467$1@dont-email.me> <irT5M.569994$5S78.431405@fx48.iad>
<u39qvj$3op8a$1@dont-email.me> <Xr56M.1703155$t5W7.1583576@fx13.iad>
<u3b5tt$3trvp$1@dont-email.me> <_sf6M.2705468$iU59.867750@fx14.iad>
<u3cbr5$5cs1$1@dont-email.me> <9mq6M.361324$rKDc.18371@fx34.iad>
<u3dr6t$adhk$1@dont-email.me> <XXz6M.596198$5CY7.189218@fx46.iad>
<u3ens7$dmlj$1@dont-email.me> <zsC6M.420575$ZnFc.164439@fx41.iad>
<u3f0i6$i6bm$1@dont-email.me> <o9L6M.2991409$vBI8.2430455@fx15.iad>
<u3g9k5$n2jk$1@dont-email.me> <6NV6M.362445$rKDc.280133@fx34.iad>
<u3hlqk$vv0u$1@dont-email.me> <1s47M.2759161$iU59.1670171@fx14.iad>
<u3it56$147a9$2@dont-email.me> <quh7M.3034951$vBI8.187696@fx15.iad>
<u3k8it$1clv7$1@dont-email.me> <LTh7M.1811499$MVg8.828957@fx12.iad>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 7bit
Injection-Date: Fri, 12 May 2023 03:30:33 -0000 (UTC)
Injection-Info: dont-email.me; posting-host="007f3be39fcbbc123c7883d64b532583";
logging-data="1478210"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX188w2+Qk/kqnFnJTlCRvcxG"
User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:102.0) Gecko/20100101
Thunderbird/102.10.1
Cancel-Lock: sha1:HoePpwCfw7tscWf/bf21mWla28Q=
In-Reply-To: <LTh7M.1811499$MVg8.828957@fx12.iad>
Content-Language: en-US
 by: olcott - Fri, 12 May 2023 03:30 UTC

On 5/11/2023 9:54 PM, Richard Damon wrote:
> On 5/11/23 10:34 PM, olcott wrote:
>
>>> FROM HIS PROOF!
>>>
>>> He first does a lot of work to establish a number of properties.
>> In other words you agree that Tarski did "prove" that the notion of
>> Truth cannot be fully formalized on a fundamental basis directly related
>> to the Liar Paradox?
>>
>
> Only in the sense that since we KNOW the Liar's paradox can't be true,
> and a "Definition of Truth" (not a "notion of Truth) would lead to being
> able to prove that the Liar's paradox is true,
>

That is ridiculous.

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

Re: Gödel's proof relies on self-contradictory expressions of language

<yDi7M.488122$Sgyc.212125@fx40.iad>

  copy mid

https://www.rocksolidbbs.com/computers/article-flat.php?id=11139&group=comp.ai.philosophy#11139

  copy link   Newsgroups: comp.theory sci.logic comp.ai.philosophy
Path: i2pn2.org!i2pn.org!weretis.net!feeder8.news.weretis.net!feeder1.feed.usenet.farm!feed.usenet.farm!peer02.ams4!peer.am4.highwinds-media.com!peer01.iad!feed-me.highwinds-media.com!news.highwinds-media.com!fx40.iad.POSTED!not-for-mail
MIME-Version: 1.0
User-Agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10.15; rv:102.0)
Gecko/20100101 Thunderbird/102.11.0
Subject: Re:_Gödel's_proof_relies_on_self-contradictory_e
xpressions_of_language
Content-Language: en-US
Newsgroups: comp.theory,sci.logic,comp.ai.philosophy
References: <u38nv6$3f467$1@dont-email.me> <irT5M.569994$5S78.431405@fx48.iad>
<u39qvj$3op8a$1@dont-email.me> <Xr56M.1703155$t5W7.1583576@fx13.iad>
<u3b5tt$3trvp$1@dont-email.me> <_sf6M.2705468$iU59.867750@fx14.iad>
<u3cbr5$5cs1$1@dont-email.me> <9mq6M.361324$rKDc.18371@fx34.iad>
<u3dr6t$adhk$1@dont-email.me> <XXz6M.596198$5CY7.189218@fx46.iad>
<u3ens7$dmlj$1@dont-email.me> <zsC6M.420575$ZnFc.164439@fx41.iad>
<u3f0i6$i6bm$1@dont-email.me> <o9L6M.2991409$vBI8.2430455@fx15.iad>
<u3g9k5$n2jk$1@dont-email.me> <6NV6M.362445$rKDc.280133@fx34.iad>
<u3hlqk$vv0u$1@dont-email.me> <1s47M.2759161$iU59.1670171@fx14.iad>
<u3it56$147a9$2@dont-email.me> <quh7M.3034951$vBI8.187696@fx15.iad>
<u3k8it$1clv7$1@dont-email.me> <LTh7M.1811499$MVg8.828957@fx12.iad>
<u3kbsp$1d3i2$1@dont-email.me>
From: Richard@Damon-Family.org (Richard Damon)
In-Reply-To: <u3kbsp$1d3i2$1@dont-email.me>
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 7bit
Lines: 30
Message-ID: <yDi7M.488122$Sgyc.212125@fx40.iad>
X-Complaints-To: abuse@easynews.com
Organization: Forte - www.forteinc.com
X-Complaints-Info: Please be sure to forward a copy of ALL headers otherwise we will be unable to process your complaint properly.
Date: Thu, 11 May 2023 23:45:34 -0400
X-Received-Bytes: 2756
 by: Richard Damon - Fri, 12 May 2023 03:45 UTC

On 5/11/23 11:30 PM, olcott wrote:
> On 5/11/2023 9:54 PM, Richard Damon wrote:
>> On 5/11/23 10:34 PM, olcott wrote:
>>
>>>> FROM HIS PROOF!
>>>>
>>>> He first does a lot of work to establish a number of properties.
>>> In other words you agree that Tarski did "prove" that the notion of
>>> Truth cannot be fully formalized on a fundamental basis directly related
>>> to the Liar Paradox?
>>>
>>
>> Only in the sense that since we KNOW the Liar's paradox can't be true,
>> and a "Definition of Truth" (not a "notion of Truth) would lead to
>> being able to prove that the Liar's paradox is true,
>>
>
> That is ridiculous.
>
>

Why? Do you think the Liar's Paradox should be provable to be True?

You seem to want to put him down for "basing" his proof on a
contradiction, but he isn't basing it in the way you want to do so.

You are just stuck trying to push a LIE, but can't quite figure out how
to do it.

Sorry, you are just too stupid to handle logic.

Re: Gödel's proof relies on self-contradictory expressions of language

<u3kgkr$1dgrj$1@dont-email.me>

  copy mid

https://www.rocksolidbbs.com/computers/article-flat.php?id=11141&group=comp.ai.philosophy#11141

  copy link   Newsgroups: comp.theory sci.logic comp.ai.philosophy
Path: i2pn2.org!i2pn.org!eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail
From: polcott2@gmail.com (olcott)
Newsgroups: comp.theory,sci.logic,comp.ai.philosophy
Subject: Re:_Gödel's_proof_relies_on_self-contradictory_e
xpressions_of_language
Date: Thu, 11 May 2023 23:51:38 -0500
Organization: A noiseless patient Spider
Lines: 40
Message-ID: <u3kgkr$1dgrj$1@dont-email.me>
References: <u38nv6$3f467$1@dont-email.me> <irT5M.569994$5S78.431405@fx48.iad>
<u39qvj$3op8a$1@dont-email.me> <Xr56M.1703155$t5W7.1583576@fx13.iad>
<u3b5tt$3trvp$1@dont-email.me> <_sf6M.2705468$iU59.867750@fx14.iad>
<u3cbr5$5cs1$1@dont-email.me> <9mq6M.361324$rKDc.18371@fx34.iad>
<u3dr6t$adhk$1@dont-email.me> <XXz6M.596198$5CY7.189218@fx46.iad>
<u3ens7$dmlj$1@dont-email.me> <zsC6M.420575$ZnFc.164439@fx41.iad>
<u3f0i6$i6bm$1@dont-email.me> <o9L6M.2991409$vBI8.2430455@fx15.iad>
<u3g9k5$n2jk$1@dont-email.me> <6NV6M.362445$rKDc.280133@fx34.iad>
<u3hlqk$vv0u$1@dont-email.me> <1s47M.2759161$iU59.1670171@fx14.iad>
<u3it56$147a9$2@dont-email.me> <quh7M.3034951$vBI8.187696@fx15.iad>
<u3k8it$1clv7$1@dont-email.me> <LTh7M.1811499$MVg8.828957@fx12.iad>
<u3kbsp$1d3i2$1@dont-email.me> <yDi7M.488122$Sgyc.212125@fx40.iad>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 7bit
Injection-Date: Fri, 12 May 2023 04:51:39 -0000 (UTC)
Injection-Info: dont-email.me; posting-host="007f3be39fcbbc123c7883d64b532583";
logging-data="1491827"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1+r5AmJARyIVUuD3LQftuWw"
User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:102.0) Gecko/20100101
Thunderbird/102.10.1
Cancel-Lock: sha1:EBx8ZbOBXsnz+F2Qe58TBGdF6BE=
In-Reply-To: <yDi7M.488122$Sgyc.212125@fx40.iad>
Content-Language: en-US
 by: olcott - Fri, 12 May 2023 04:51 UTC

On 5/11/2023 10:45 PM, Richard Damon wrote:
> On 5/11/23 11:30 PM, olcott wrote:
>> On 5/11/2023 9:54 PM, Richard Damon wrote:
>>> On 5/11/23 10:34 PM, olcott wrote:
>>>
>>>>> FROM HIS PROOF!
>>>>>
>>>>> He first does a lot of work to establish a number of properties.
>>>> In other words you agree that Tarski did "prove" that the notion of
>>>> Truth cannot be fully formalized on a fundamental basis directly
>>>> related
>>>> to the Liar Paradox?
>>>>
>>>
>>> Only in the sense that since we KNOW the Liar's paradox can't be
>>> true, and a "Definition of Truth" (not a "notion of Truth) would lead
>>> to being able to prove that the Liar's paradox is true,
>>>
>>
>> That is ridiculous.
>>
>>
>
> Why? Do you think the Liar's Paradox should be provable to be True?
>

The Liar Paradox is not a truth bearer, END-OF-STORY !!!

> You seem to want to put him down for "basing" his proof on a
> contradiction, but he isn't basing it in the way you want to do so.
>
> You are just stuck trying to push a LIE, but can't quite figure out how
> to do it.
>
> Sorry, you are just too stupid to handle logic.

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

Re: Gödel's proof relies on self-contradictory expressions of language

<ad7b8be6-09fd-4efc-af82-3c3eb5e795ben@googlegroups.com>

  copy mid

https://www.rocksolidbbs.com/computers/article-flat.php?id=11142&group=comp.ai.philosophy#11142

  copy link   Newsgroups: comp.ai.philosophy
X-Received: by 2002:ad4:550e:0:b0:5e6:4193:996f with SMTP id pz14-20020ad4550e000000b005e64193996fmr4244849qvb.9.1683895542615;
Fri, 12 May 2023 05:45:42 -0700 (PDT)
X-Received: by 2002:a25:5404:0:b0:b8b:f5fb:598d with SMTP id
i4-20020a255404000000b00b8bf5fb598dmr15058745ybb.6.1683895542386; Fri, 12 May
2023 05:45:42 -0700 (PDT)
Path: i2pn2.org!i2pn.org!weretis.net!feeder8.news.weretis.net!feeder1.feed.usenet.farm!feed.usenet.farm!peer02.ams4!peer.am4.highwinds-media.com!peer03.iad!feed-me.highwinds-media.com!news.highwinds-media.com!news-out.google.com!nntp.google.com!postnews.google.com!google-groups.googlegroups.com!not-for-mail
Newsgroups: comp.ai.philosophy
Date: Fri, 12 May 2023 05:45:42 -0700 (PDT)
In-Reply-To: <u3kgkr$1dgrj$1@dont-email.me>
Injection-Info: google-groups.googlegroups.com; posting-host=173.219.77.176; posting-account=iBgNeAoAAADRhzuSC4Ai7MUeMmxtwlM7
NNTP-Posting-Host: 173.219.77.176
References: <u38nv6$3f467$1@dont-email.me> <irT5M.569994$5S78.431405@fx48.iad>
<u39qvj$3op8a$1@dont-email.me> <Xr56M.1703155$t5W7.1583576@fx13.iad>
<u3b5tt$3trvp$1@dont-email.me> <_sf6M.2705468$iU59.867750@fx14.iad>
<u3cbr5$5cs1$1@dont-email.me> <9mq6M.361324$rKDc.18371@fx34.iad>
<u3dr6t$adhk$1@dont-email.me> <XXz6M.596198$5CY7.189218@fx46.iad>
<u3ens7$dmlj$1@dont-email.me> <zsC6M.420575$ZnFc.164439@fx41.iad>
<u3f0i6$i6bm$1@dont-email.me> <o9L6M.2991409$vBI8.2430455@fx15.iad>
<u3g9k5$n2jk$1@dont-email.me> <6NV6M.362445$rKDc.280133@fx34.iad>
<u3hlqk$vv0u$1@dont-email.me> <1s47M.2759161$iU59.1670171@fx14.iad>
<u3it56$147a9$2@dont-email.me> <quh7M.3034951$vBI8.187696@fx15.iad>
<u3k8it$1clv7$1@dont-email.me> <LTh7M.1811499$MVg8.828957@fx12.iad>
<u3kbsp$1d3i2$1@dont-email.me> <yDi7M.488122$Sgyc.212125@fx40.iad> <u3kgkr$1dgrj$1@dont-email.me>
User-Agent: G2/1.0
MIME-Version: 1.0
Message-ID: <ad7b8be6-09fd-4efc-af82-3c3eb5e795ben@googlegroups.com>
Subject: Re:_Gödel's_proof_relies_on_self-contradictory_expr
essions_of_language
From: donstockbauer@hotmail.com (Don Stockbauer)
Injection-Date: Fri, 12 May 2023 12:45:42 +0000
Content-Type: text/plain; charset="UTF-8"
Content-Transfer-Encoding: quoted-printable
X-Received-Bytes: 3678
 by: Don Stockbauer - Fri, 12 May 2023 12:45 UTC

On Thursday, May 11, 2023 at 11:53:16 PM UTC-5, olcott wrote:
> On 5/11/2023 10:45 PM, Richard Damon wrote:
> > On 5/11/23 11:30 PM, olcott wrote:
> >> On 5/11/2023 9:54 PM, Richard Damon wrote:
> >>> On 5/11/23 10:34 PM, olcott wrote:
> >>>
> >>>>> FROM HIS PROOF!
> >>>>>
> >>>>> He first does a lot of work to establish a number of properties.
> >>>> In other words you agree that Tarski did "prove" that the notion of
> >>>> Truth cannot be fully formalized on a fundamental basis directly
> >>>> related
> >>>> to the Liar Paradox?
> >>>>
> >>>
> >>> Only in the sense that since we KNOW the Liar's paradox can't be
> >>> true, and a "Definition of Truth" (not a "notion of Truth) would lead
> >>> to being able to prove that the Liar's paradox is true,
> >>>
> >>
> >> That is ridiculous.
> >>
> >>
> >
> > Why? Do you think the Liar's Paradox should be provable to be True?
> >
> The Liar Paradox is not a truth bearer, END-OF-STORY !!!
> > You seem to want to put him down for "basing" his proof on a
> > contradiction, but he isn't basing it in the way you want to do so.
> >
> > You are just stuck trying to push a LIE, but can't quite figure out how
> > to do it.
> >
> > Sorry, you are just too stupid to handle logic.
> --
> Copyright 2023 Olcott "Talent hits a target no one else can hit; Genius
> hits a target no one else can see." Arthur Schopenhauer

None of this puts food on the table.

Re: Gödel's proof relies on self-contradictory expressions of language

<1Kr7M.220169$T%ac.214451@fx01.iad>

  copy mid

https://www.rocksolidbbs.com/computers/article-flat.php?id=11145&group=comp.ai.philosophy#11145

  copy link   Newsgroups: comp.theory sci.logic comp.ai.philosophy
Path: i2pn2.org!i2pn.org!usenet.blueworldhosting.com!diablo1.usenet.blueworldhosting.com!peer01.iad!feed-me.highwinds-media.com!news.highwinds-media.com!fx01.iad.POSTED!not-for-mail
MIME-Version: 1.0
User-Agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10.15; rv:102.0)
Gecko/20100101 Thunderbird/102.11.0
Subject: Re:_Gödel's_proof_relies_on_self-contradictory_e
xpressions_of_language
Newsgroups: comp.theory,sci.logic,comp.ai.philosophy
References: <u38nv6$3f467$1@dont-email.me> <irT5M.569994$5S78.431405@fx48.iad>
<u39qvj$3op8a$1@dont-email.me> <Xr56M.1703155$t5W7.1583576@fx13.iad>
<u3b5tt$3trvp$1@dont-email.me> <_sf6M.2705468$iU59.867750@fx14.iad>
<u3cbr5$5cs1$1@dont-email.me> <9mq6M.361324$rKDc.18371@fx34.iad>
<u3dr6t$adhk$1@dont-email.me> <XXz6M.596198$5CY7.189218@fx46.iad>
<u3ens7$dmlj$1@dont-email.me> <zsC6M.420575$ZnFc.164439@fx41.iad>
<u3f0i6$i6bm$1@dont-email.me> <o9L6M.2991409$vBI8.2430455@fx15.iad>
<u3g9k5$n2jk$1@dont-email.me> <6NV6M.362445$rKDc.280133@fx34.iad>
<u3hlqk$vv0u$1@dont-email.me> <1s47M.2759161$iU59.1670171@fx14.iad>
<u3it56$147a9$2@dont-email.me> <quh7M.3034951$vBI8.187696@fx15.iad>
<u3k8it$1clv7$1@dont-email.me> <LTh7M.1811499$MVg8.828957@fx12.iad>
<u3kbsp$1d3i2$1@dont-email.me> <yDi7M.488122$Sgyc.212125@fx40.iad>
<u3kgkr$1dgrj$1@dont-email.me>
From: Richard@Damon-Family.org (Richard Damon)
Content-Language: en-US
In-Reply-To: <u3kgkr$1dgrj$1@dont-email.me>
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 7bit
Lines: 53
Message-ID: <1Kr7M.220169$T%ac.214451@fx01.iad>
X-Complaints-To: abuse@easynews.com
Organization: Forte - www.forteinc.com
X-Complaints-Info: Please be sure to forward a copy of ALL headers otherwise we will be unable to process your complaint properly.
Date: Fri, 12 May 2023 10:06:54 -0400
X-Received-Bytes: 3410
 by: Richard Damon - Fri, 12 May 2023 14:06 UTC

On 5/12/23 12:51 AM, olcott wrote:
> On 5/11/2023 10:45 PM, Richard Damon wrote:
>> On 5/11/23 11:30 PM, olcott wrote:
>>> On 5/11/2023 9:54 PM, Richard Damon wrote:
>>>> On 5/11/23 10:34 PM, olcott wrote:
>>>>
>>>>>> FROM HIS PROOF!
>>>>>>
>>>>>> He first does a lot of work to establish a number of properties.
>>>>> In other words you agree that Tarski did "prove" that the notion of
>>>>> Truth cannot be fully formalized on a fundamental basis directly
>>>>> related
>>>>> to the Liar Paradox?
>>>>>
>>>>
>>>> Only in the sense that since we KNOW the Liar's paradox can't be
>>>> true, and a "Definition of Truth" (not a "notion of Truth) would
>>>> lead to being able to prove that the Liar's paradox is true,
>>>>
>>>
>>> That is ridiculous.
>>>
>>>
>>
>> Why? Do you think the Liar's Paradox should be provable to be True?
>>
>
> The Liar Paradox is not a truth bearer, END-OF-STORY !!!

Right, so why do you fault Tarski for saying that?

His proof shows that if a "Definition of Truth" existed, it provides a
way to prove the Liar's Paradox is True.

Therefore, there can be no "Definition of Truth".

I've explained that to you many times, but you say that is invalid logic.

The only way it is invalid is if you think it is possible to actually
prove the Liar's paradox.

You are just showing your stupidity.

>
>> You seem to want to put him down for "basing" his proof on a
>> contradiction, but he isn't basing it in the way you want to do so.
>>
>> You are just stuck trying to push a LIE, but can't quite figure out
>> how to do it.
>>
>> Sorry, you are just too stupid to handle logic.
>

Re: Gödel's proof relies on self-contradictory expressions of language

<IfGdnWIvve0LyMP5nZ2dnZfqlJ9j4p2d@giganews.com>

  copy mid

https://www.rocksolidbbs.com/computers/article-flat.php?id=11148&group=comp.ai.philosophy#11148

  copy link   Newsgroups: comp.theory sci.logic comp.ai.philosophy
Path: i2pn2.org!i2pn.org!weretis.net!feeder6.news.weretis.net!news.misty.com!border-2.nntp.ord.giganews.com!nntp.giganews.com!Xl.tags.giganews.com!local-1.nntp.ord.giganews.com!news.giganews.com.POSTED!not-for-mail
NNTP-Posting-Date: Fri, 12 May 2023 15:04:54 +0000
Date: Fri, 12 May 2023 10:04:54 -0500
MIME-Version: 1.0
User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:102.0) Gecko/20100101
Thunderbird/102.10.1
Subject: Re:_Gödel's_proof_relies_on_self-contradictory_e
xpressions_of_language
Newsgroups: comp.theory,sci.logic,comp.ai.philosophy
References: <u38nv6$3f467$1@dont-email.me> <irT5M.569994$5S78.431405@fx48.iad>
<u39qvj$3op8a$1@dont-email.me> <Xr56M.1703155$t5W7.1583576@fx13.iad>
<u3b5tt$3trvp$1@dont-email.me> <_sf6M.2705468$iU59.867750@fx14.iad>
<u3cbr5$5cs1$1@dont-email.me> <9mq6M.361324$rKDc.18371@fx34.iad>
<u3dr6t$adhk$1@dont-email.me> <XXz6M.596198$5CY7.189218@fx46.iad>
<u3ens7$dmlj$1@dont-email.me> <zsC6M.420575$ZnFc.164439@fx41.iad>
<u3f0i6$i6bm$1@dont-email.me> <o9L6M.2991409$vBI8.2430455@fx15.iad>
<u3g9k5$n2jk$1@dont-email.me> <6NV6M.362445$rKDc.280133@fx34.iad>
<u3hlqk$vv0u$1@dont-email.me> <1s47M.2759161$iU59.1670171@fx14.iad>
<u3it56$147a9$2@dont-email.me> <quh7M.3034951$vBI8.187696@fx15.iad>
<u3k8it$1clv7$1@dont-email.me> <LTh7M.1811499$MVg8.828957@fx12.iad>
<u3kbsp$1d3i2$1@dont-email.me> <yDi7M.488122$Sgyc.212125@fx40.iad>
<u3kgkr$1dgrj$1@dont-email.me> <1Kr7M.220169$T%ac.214451@fx01.iad>
Content-Language: en-US
From: NoOne@NoWhere.com (olcott)
In-Reply-To: <1Kr7M.220169$T%ac.214451@fx01.iad>
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 7bit
Message-ID: <IfGdnWIvve0LyMP5nZ2dnZfqlJ9j4p2d@giganews.com>
Lines: 65
X-Usenet-Provider: http://www.giganews.com
X-Trace: sv3-FRRSiQ3VkUlAij40SiZoGCPoZidnVR5GtHEY0ey8Cs9SVktzmOFTjNU/NnQ2SPHe6b9iwn9B8U+9vFw!ILYd+EBUf4SR9JhAj3nr9ikQ5tVqyPjXWYsx4iNfBCP5eOoOJ3TYgviReD3A65SasFnfcdGKr8U=
X-Complaints-To: abuse@giganews.com
X-DMCA-Notifications: http://www.giganews.com/info/dmca.html
X-Abuse-and-DMCA-Info: Please be sure to forward a copy of ALL headers
X-Abuse-and-DMCA-Info: Otherwise we will be unable to process your complaint properly
X-Postfilter: 1.3.40
 by: olcott - Fri, 12 May 2023 15:04 UTC

On 5/12/2023 9:06 AM, Richard Damon wrote:
> On 5/12/23 12:51 AM, olcott wrote:
>> On 5/11/2023 10:45 PM, Richard Damon wrote:
>>> On 5/11/23 11:30 PM, olcott wrote:
>>>> On 5/11/2023 9:54 PM, Richard Damon wrote:
>>>>> On 5/11/23 10:34 PM, olcott wrote:
>>>>>
>>>>>>> FROM HIS PROOF!
>>>>>>>
>>>>>>> He first does a lot of work to establish a number of properties.
>>>>>> In other words you agree that Tarski did "prove" that the notion of
>>>>>> Truth cannot be fully formalized on a fundamental basis directly
>>>>>> related
>>>>>> to the Liar Paradox?
>>>>>>
>>>>>
>>>>> Only in the sense that since we KNOW the Liar's paradox can't be
>>>>> true, and a "Definition of Truth" (not a "notion of Truth) would
>>>>> lead to being able to prove that the Liar's paradox is true,
>>>>>
>>>>
>>>> That is ridiculous.
>>>>
>>>>
>>>
>>> Why? Do you think the Liar's Paradox should be provable to be True?
>>>
>>
>> The Liar Paradox is not a truth bearer, END-OF-STORY !!!
>
> Right, so why do you fault Tarski for saying that?
>
> His proof shows that if a "Definition of Truth" existed, it provides a
> way to prove the Liar's Paradox is True.
That is a nutty idea.
Any system that proves that a self-contradictory expression is true is a
broken system.

Analytic truth is derived from applying truth preserving operations to
expressions of language that have been stipulated to be true.
This cannot possibly derive non-truth bearers as true.

Prolog uses the exact same system that I just specified expressions that
are stipulated to be true are Prolog facts with Prolog rules as a set of
truth preserving operations.

Prolog is smart enough to reject the Liar Paradox.

?- LP = not(true(LP)).
LP = not(true(LP)).

?- unify_with_occurs_check(LP, not(true(LP))).
false.

The above test shows that LP is infinitely recursive never resolving to
a truth value.

--
Copyright 2023 Olcott

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

Re: Gödel's proof relies on self-contradictory expressions of language

<fMv7M.491956$Sgyc.243894@fx40.iad>

  copy mid

https://www.rocksolidbbs.com/computers/article-flat.php?id=11151&group=comp.ai.philosophy#11151

  copy link   Newsgroups: comp.theory sci.logic comp.ai.philosophy
Path: i2pn2.org!i2pn.org!usenet.blueworldhosting.com!diablo1.usenet.blueworldhosting.com!peer02.iad!feed-me.highwinds-media.com!news.highwinds-media.com!fx40.iad.POSTED!not-for-mail
MIME-Version: 1.0
User-Agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10.15; rv:102.0)
Gecko/20100101 Thunderbird/102.11.0
Subject: Re:_Gödel's_proof_relies_on_self-contradictory_e
xpressions_of_language
Newsgroups: comp.theory,sci.logic,comp.ai.philosophy
References: <u38nv6$3f467$1@dont-email.me> <irT5M.569994$5S78.431405@fx48.iad>
<u39qvj$3op8a$1@dont-email.me> <Xr56M.1703155$t5W7.1583576@fx13.iad>
<u3b5tt$3trvp$1@dont-email.me> <_sf6M.2705468$iU59.867750@fx14.iad>
<u3cbr5$5cs1$1@dont-email.me> <9mq6M.361324$rKDc.18371@fx34.iad>
<u3dr6t$adhk$1@dont-email.me> <XXz6M.596198$5CY7.189218@fx46.iad>
<u3ens7$dmlj$1@dont-email.me> <zsC6M.420575$ZnFc.164439@fx41.iad>
<u3f0i6$i6bm$1@dont-email.me> <o9L6M.2991409$vBI8.2430455@fx15.iad>
<u3g9k5$n2jk$1@dont-email.me> <6NV6M.362445$rKDc.280133@fx34.iad>
<u3hlqk$vv0u$1@dont-email.me> <1s47M.2759161$iU59.1670171@fx14.iad>
<u3it56$147a9$2@dont-email.me> <quh7M.3034951$vBI8.187696@fx15.iad>
<u3k8it$1clv7$1@dont-email.me> <LTh7M.1811499$MVg8.828957@fx12.iad>
<u3kbsp$1d3i2$1@dont-email.me> <yDi7M.488122$Sgyc.212125@fx40.iad>
<u3kgkr$1dgrj$1@dont-email.me> <1Kr7M.220169$T%ac.214451@fx01.iad>
<IfGdnWIvve0LyMP5nZ2dnZfqlJ9j4p2d@giganews.com>
From: Richard@Damon-Family.org (Richard Damon)
Content-Language: en-US
In-Reply-To: <IfGdnWIvve0LyMP5nZ2dnZfqlJ9j4p2d@giganews.com>
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 7bit
Lines: 74
Message-ID: <fMv7M.491956$Sgyc.243894@fx40.iad>
X-Complaints-To: abuse@easynews.com
Organization: Forte - www.forteinc.com
X-Complaints-Info: Please be sure to forward a copy of ALL headers otherwise we will be unable to process your complaint properly.
Date: Fri, 12 May 2023 14:42:20 -0400
X-Received-Bytes: 4165
 by: Richard Damon - Fri, 12 May 2023 18:42 UTC

On 5/12/23 11:04 AM, olcott wrote:
> On 5/12/2023 9:06 AM, Richard Damon wrote:
>> On 5/12/23 12:51 AM, olcott wrote:
>>> On 5/11/2023 10:45 PM, Richard Damon wrote:
>>>> On 5/11/23 11:30 PM, olcott wrote:
>>>>> On 5/11/2023 9:54 PM, Richard Damon wrote:
>>>>>> On 5/11/23 10:34 PM, olcott wrote:
>>>>>>
>>>>>>>> FROM HIS PROOF!
>>>>>>>>
>>>>>>>> He first does a lot of work to establish a number of properties.
>>>>>>> In other words you agree that Tarski did "prove" that the notion of
>>>>>>> Truth cannot be fully formalized on a fundamental basis directly
>>>>>>> related
>>>>>>> to the Liar Paradox?
>>>>>>>
>>>>>>
>>>>>> Only in the sense that since we KNOW the Liar's paradox can't be
>>>>>> true, and a "Definition of Truth" (not a "notion of Truth) would
>>>>>> lead to being able to prove that the Liar's paradox is true,
>>>>>>
>>>>>
>>>>> That is ridiculous.
>>>>>
>>>>>
>>>>
>>>> Why? Do you think the Liar's Paradox should be provable to be True?
>>>>
>>>
>>> The Liar Paradox is not a truth bearer, END-OF-STORY !!!
>>
>> Right, so why do you fault Tarski for saying that?
>>
>> His proof shows that if a "Definition of Truth" existed, it provides a
>> way to prove the Liar's Paradox is True.
> That is a nutty idea.
> Any system that proves that a self-contradictory expression is true is a
> broken system.

Right, and the proof shows that would be any system with a "definition
of Truth", so you AGREE with Tarski.

>
> Analytic truth is derived from applying truth preserving operations to
> expressions of language that have been stipulated to be true.
> This cannot possibly derive non-truth bearers as true.

Right, so you agre with Tarksi that there can not be a "Definition of
Truth".

>
> Prolog uses the exact same system that I just specified expressions that
> are stipulated to be true are Prolog facts with Prolog rules as a set of
> truth preserving operations.

Prolog is limited in the logic it can do,

But, so it seems are you.

>
> Prolog is smart enough to reject the Liar Paradox.
>
> ?- LP = not(true(LP)).
> LP = not(true(LP)).
>
> ?- unify_with_occurs_check(LP, not(true(LP))).
> false.
>
> The above test shows that LP is infinitely recursive never resolving to
> a truth value.
>
>

So?

Re: Gödel's proof relies on self-contradictory expressions of language

<u3mco8$1qmer$2@dont-email.me>

  copy mid

https://www.rocksolidbbs.com/computers/article-flat.php?id=11153&group=comp.ai.philosophy#11153

  copy link   Newsgroups: comp.theory sci.logic comp.ai.philosophy
Path: i2pn2.org!i2pn.org!eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail
From: polcott2@gmail.com (olcott)
Newsgroups: comp.theory,sci.logic,comp.ai.philosophy
Subject: Re:_Gödel's_proof_relies_on_self-contradictory_e
xpressions_of_language
Date: Fri, 12 May 2023 16:57:28 -0500
Organization: A noiseless patient Spider
Lines: 94
Message-ID: <u3mco8$1qmer$2@dont-email.me>
References: <u38nv6$3f467$1@dont-email.me> <irT5M.569994$5S78.431405@fx48.iad>
<u39qvj$3op8a$1@dont-email.me> <Xr56M.1703155$t5W7.1583576@fx13.iad>
<u3b5tt$3trvp$1@dont-email.me> <_sf6M.2705468$iU59.867750@fx14.iad>
<u3cbr5$5cs1$1@dont-email.me> <9mq6M.361324$rKDc.18371@fx34.iad>
<u3dr6t$adhk$1@dont-email.me> <XXz6M.596198$5CY7.189218@fx46.iad>
<u3ens7$dmlj$1@dont-email.me> <zsC6M.420575$ZnFc.164439@fx41.iad>
<u3f0i6$i6bm$1@dont-email.me> <o9L6M.2991409$vBI8.2430455@fx15.iad>
<u3g9k5$n2jk$1@dont-email.me> <6NV6M.362445$rKDc.280133@fx34.iad>
<u3hlqk$vv0u$1@dont-email.me> <1s47M.2759161$iU59.1670171@fx14.iad>
<u3it56$147a9$2@dont-email.me> <quh7M.3034951$vBI8.187696@fx15.iad>
<u3k8it$1clv7$1@dont-email.me> <LTh7M.1811499$MVg8.828957@fx12.iad>
<u3kbsp$1d3i2$1@dont-email.me> <yDi7M.488122$Sgyc.212125@fx40.iad>
<u3kgkr$1dgrj$1@dont-email.me> <1Kr7M.220169$T%ac.214451@fx01.iad>
<IfGdnWIvve0LyMP5nZ2dnZfqlJ9j4p2d@giganews.com>
<fMv7M.491956$Sgyc.243894@fx40.iad>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 7bit
Injection-Date: Fri, 12 May 2023 21:57:28 -0000 (UTC)
Injection-Info: dont-email.me; posting-host="007f3be39fcbbc123c7883d64b532583";
logging-data="1923547"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX18kCtD/lNRljVp/UGTHjLOF"
User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:102.0) Gecko/20100101
Thunderbird/102.10.1
Cancel-Lock: sha1:LXFWz4d/XjdtS4FZTeG/poPLO2c=
In-Reply-To: <fMv7M.491956$Sgyc.243894@fx40.iad>
Content-Language: en-US
 by: olcott - Fri, 12 May 2023 21:57 UTC

On 5/12/2023 1:42 PM, Richard Damon wrote:
> On 5/12/23 11:04 AM, olcott wrote:
>> On 5/12/2023 9:06 AM, Richard Damon wrote:
>>> On 5/12/23 12:51 AM, olcott wrote:
>>>> On 5/11/2023 10:45 PM, Richard Damon wrote:
>>>>> On 5/11/23 11:30 PM, olcott wrote:
>>>>>> On 5/11/2023 9:54 PM, Richard Damon wrote:
>>>>>>> On 5/11/23 10:34 PM, olcott wrote:
>>>>>>>
>>>>>>>>> FROM HIS PROOF!
>>>>>>>>>
>>>>>>>>> He first does a lot of work to establish a number of properties.
>>>>>>>> In other words you agree that Tarski did "prove" that the notion of
>>>>>>>> Truth cannot be fully formalized on a fundamental basis directly
>>>>>>>> related
>>>>>>>> to the Liar Paradox?
>>>>>>>>
>>>>>>>
>>>>>>> Only in the sense that since we KNOW the Liar's paradox can't be
>>>>>>> true, and a "Definition of Truth" (not a "notion of Truth) would
>>>>>>> lead to being able to prove that the Liar's paradox is true,
>>>>>>>
>>>>>>
>>>>>> That is ridiculous.
>>>>>>
>>>>>>
>>>>>
>>>>> Why? Do you think the Liar's Paradox should be provable to be True?
>>>>>
>>>>
>>>> The Liar Paradox is not a truth bearer, END-OF-STORY !!!
>>>
>>> Right, so why do you fault Tarski for saying that?
>>>
>>> His proof shows that if a "Definition of Truth" existed, it provides
>>> a way to prove the Liar's Paradox is True.
>> That is a nutty idea.
>> Any system that proves that a self-contradictory expression is true is
>> a broken system.
>
> Right, and the proof shows that would be any system with a "definition
> of Truth", so you AGREE with Tarski.
>

Not at all, Tarski's system is incorrect. All of analytical truth1 is a
body of semantic tautologies that excludes the liar paradox.

1 It is commonly known that analytical truth includes all of math and
all of logic. My new idea is that it also includes the model of the
world.

>>
>> Analytic truth is derived from applying truth preserving operations to
>> expressions of language that have been stipulated to be true.
>> This cannot possibly derive non-truth bearers as true.
>
> Right, so you agre with Tarksi that there can not be a "Definition of
> Truth".
>

Not at all.

>>
>> Prolog uses the exact same system that I just specified expressions that
>> are stipulated to be true are Prolog facts with Prolog rules as a set of
>> truth preserving operations.
>
> Prolog is limited in the logic it can do,
>
> But, so it seems are you.
>
>>
>> Prolog is smart enough to reject the Liar Paradox.
>>
>> ?- LP = not(true(LP)).
>> LP = not(true(LP)).
>>
>> ?- unify_with_occurs_check(LP, not(true(LP))).
>> false.
>>
>> The above test shows that LP is infinitely recursive never resolving
>> to a truth value.
>>
>>
>
> So?

Tarski was too stupid (on this one issue) to understand that the Liar
Paradox is excluded from the body of truth.

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

Re: Gödel's proof relies on self-contradictory expressions of language

<u3mkn4$1rle3$1@dont-email.me>

  copy mid

https://www.rocksolidbbs.com/computers/article-flat.php?id=11155&group=comp.ai.philosophy#11155

  copy link   Newsgroups: comp.theory sci.logic comp.ai.philosophy
Path: i2pn2.org!i2pn.org!eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail
From: polcott2@gmail.com (olcott)
Newsgroups: comp.theory,sci.logic,comp.ai.philosophy
Subject: Re:_Gödel's_proof_relies_on_self-contradictory_e
xpressions_of_language
Date: Fri, 12 May 2023 19:13:23 -0500
Organization: A noiseless patient Spider
Lines: 72
Message-ID: <u3mkn4$1rle3$1@dont-email.me>
References: <u38nv6$3f467$1@dont-email.me> <irT5M.569994$5S78.431405@fx48.iad>
<u39qvj$3op8a$1@dont-email.me> <Xr56M.1703155$t5W7.1583576@fx13.iad>
<u3b5tt$3trvp$1@dont-email.me> <_sf6M.2705468$iU59.867750@fx14.iad>
<u3cbr5$5cs1$1@dont-email.me> <9mq6M.361324$rKDc.18371@fx34.iad>
<u3dr6t$adhk$1@dont-email.me> <XXz6M.596198$5CY7.189218@fx46.iad>
<u3ens7$dmlj$1@dont-email.me> <zsC6M.420575$ZnFc.164439@fx41.iad>
<u3f0i6$i6bm$1@dont-email.me> <o9L6M.2991409$vBI8.2430455@fx15.iad>
<u3g9k5$n2jk$1@dont-email.me> <6NV6M.362445$rKDc.280133@fx34.iad>
<u3hlqk$vv0u$1@dont-email.me> <1s47M.2759161$iU59.1670171@fx14.iad>
<u3it56$147a9$2@dont-email.me> <quh7M.3034951$vBI8.187696@fx15.iad>
<u3k8it$1clv7$1@dont-email.me> <LTh7M.1811499$MVg8.828957@fx12.iad>
<u3kbsp$1d3i2$1@dont-email.me> <yDi7M.488122$Sgyc.212125@fx40.iad>
<u3kgkr$1dgrj$1@dont-email.me> <1Kr7M.220169$T%ac.214451@fx01.iad>
<IfGdnWIvve0LyMP5nZ2dnZfqlJ9j4p2d@giganews.com>
<fMv7M.491956$Sgyc.243894@fx40.iad>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 7bit
Injection-Date: Sat, 13 May 2023 00:13:24 -0000 (UTC)
Injection-Info: dont-email.me; posting-host="007dd2e088d4657e4439604c2261e9bf";
logging-data="1955267"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1+X9wWaWNRJXBYBkQF5E1RP"
User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:102.0) Gecko/20100101
Thunderbird/102.10.1
Cancel-Lock: sha1:7QP5PQi3Z4IXymkl0YSyqG2yIkA=
Content-Language: en-US
In-Reply-To: <fMv7M.491956$Sgyc.243894@fx40.iad>
 by: olcott - Sat, 13 May 2023 00:13 UTC

On 5/12/2023 1:42 PM, Richard Damon wrote:
> On 5/12/23 11:04 AM, olcott wrote:
>> On 5/12/2023 9:06 AM, Richard Damon wrote:
>>> On 5/12/23 12:51 AM, olcott wrote:
>>>> On 5/11/2023 10:45 PM, Richard Damon wrote:
>>>>> On 5/11/23 11:30 PM, olcott wrote:
>>>>>> On 5/11/2023 9:54 PM, Richard Damon wrote:
>>>>>>> On 5/11/23 10:34 PM, olcott wrote:
>>>>>>>
>>>>>>>>> FROM HIS PROOF!
>>>>>>>>>
>>>>>>>>> He first does a lot of work to establish a number of properties.
>>>>>>>> In other words you agree that Tarski did "prove" that the notion of
>>>>>>>> Truth cannot be fully formalized on a fundamental basis directly
>>>>>>>> related
>>>>>>>> to the Liar Paradox?
>>>>>>>>
>>>>>>>
>>>>>>> Only in the sense that since we KNOW the Liar's paradox can't be
>>>>>>> true, and a "Definition of Truth" (not a "notion of Truth) would
>>>>>>> lead to being able to prove that the Liar's paradox is true,
>>>>>>>
>>>>>>
>>>>>> That is ridiculous.
>>>>>>
>>>>>>
>>>>>
>>>>> Why? Do you think the Liar's Paradox should be provable to be True?
>>>>>
>>>>
>>>> The Liar Paradox is not a truth bearer, END-OF-STORY !!!
>>>
>>> Right, so why do you fault Tarski for saying that?
>>>
>>> His proof shows that if a "Definition of Truth" existed, it provides
>>> a way to prove the Liar's Paradox is True.
>> That is a nutty idea.
>> Any system that proves that a self-contradictory expression is true is
>> a broken system.
>
> Right, and the proof shows that would be any system with a "definition
> of Truth", so you AGREE with Tarski.
>

Not at all, Tarski's system is incorrect. All of analytical truth1 is a
body of semantic tautologies that excludes the liar paradox.

1 It is commonly known that analytical truth includes all of math and
all of logic. My new idea is that it also includes the model of the
world.

Prolog is smart enough to reject the Liar Paradox because it uses the
same system that I use, only expressions of language that have been
derived by applying truth preserving operations [Prolog rules] to
expressions of language that have been stipulated to be true [Prolog
facts] are true. Everything else [Prolog's negation as failure] counts
as untrue.

?- LP = not(true(LP)).
LP = not(true(LP)).

?- unify_with_occurs_check(LP, not(true(LP))).
false.

The above test shows that LP is infinitely recursive never resolving to
a truth value.

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

Re: Gödel's proof relies on self-contradictory expressions of language

<JrC7M.427053$ZhSc.340319@fx38.iad>

  copy mid

https://www.rocksolidbbs.com/computers/article-flat.php?id=11158&group=comp.ai.philosophy#11158

  copy link   Newsgroups: comp.theory sci.logic comp.ai.philosophy
Path: i2pn2.org!i2pn.org!weretis.net!feeder8.news.weretis.net!feeder1.feed.usenet.farm!feed.usenet.farm!peer01.ams4!peer.am4.highwinds-media.com!peer01.iad!feed-me.highwinds-media.com!news.highwinds-media.com!fx38.iad.POSTED!not-for-mail
MIME-Version: 1.0
User-Agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10.15; rv:102.0)
Gecko/20100101 Thunderbird/102.11.0
Subject: Re:_Gödel's_proof_relies_on_self-contradictory_e
xpressions_of_language
Content-Language: en-US
Newsgroups: comp.theory,sci.logic,comp.ai.philosophy
References: <u38nv6$3f467$1@dont-email.me> <u39qvj$3op8a$1@dont-email.me>
<Xr56M.1703155$t5W7.1583576@fx13.iad> <u3b5tt$3trvp$1@dont-email.me>
<_sf6M.2705468$iU59.867750@fx14.iad> <u3cbr5$5cs1$1@dont-email.me>
<9mq6M.361324$rKDc.18371@fx34.iad> <u3dr6t$adhk$1@dont-email.me>
<XXz6M.596198$5CY7.189218@fx46.iad> <u3ens7$dmlj$1@dont-email.me>
<zsC6M.420575$ZnFc.164439@fx41.iad> <u3f0i6$i6bm$1@dont-email.me>
<o9L6M.2991409$vBI8.2430455@fx15.iad> <u3g9k5$n2jk$1@dont-email.me>
<6NV6M.362445$rKDc.280133@fx34.iad> <u3hlqk$vv0u$1@dont-email.me>
<1s47M.2759161$iU59.1670171@fx14.iad> <u3it56$147a9$2@dont-email.me>
<quh7M.3034951$vBI8.187696@fx15.iad> <u3k8it$1clv7$1@dont-email.me>
<LTh7M.1811499$MVg8.828957@fx12.iad> <u3kbsp$1d3i2$1@dont-email.me>
<yDi7M.488122$Sgyc.212125@fx40.iad> <u3kgkr$1dgrj$1@dont-email.me>
<1Kr7M.220169$T%ac.214451@fx01.iad>
<IfGdnWIvve0LyMP5nZ2dnZfqlJ9j4p2d@giganews.com>
<fMv7M.491956$Sgyc.243894@fx40.iad> <u3mkn4$1rle3$1@dont-email.me>
From: Richard@Damon-Family.org (Richard Damon)
In-Reply-To: <u3mkn4$1rle3$1@dont-email.me>
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 7bit
Lines: 88
Message-ID: <JrC7M.427053$ZhSc.340319@fx38.iad>
X-Complaints-To: abuse@easynews.com
Organization: Forte - www.forteinc.com
X-Complaints-Info: Please be sure to forward a copy of ALL headers otherwise we will be unable to process your complaint properly.
Date: Fri, 12 May 2023 22:18:19 -0400
X-Received-Bytes: 4977
 by: Richard Damon - Sat, 13 May 2023 02:18 UTC

On 5/12/23 8:13 PM, olcott wrote:
> On 5/12/2023 1:42 PM, Richard Damon wrote:
>> On 5/12/23 11:04 AM, olcott wrote:
>>> On 5/12/2023 9:06 AM, Richard Damon wrote:
>>>> On 5/12/23 12:51 AM, olcott wrote:
>>>>> On 5/11/2023 10:45 PM, Richard Damon wrote:
>>>>>> On 5/11/23 11:30 PM, olcott wrote:
>>>>>>> On 5/11/2023 9:54 PM, Richard Damon wrote:
>>>>>>>> On 5/11/23 10:34 PM, olcott wrote:
>>>>>>>>
>>>>>>>>>> FROM HIS PROOF!
>>>>>>>>>>
>>>>>>>>>> He first does a lot of work to establish a number of properties.
>>>>>>>>> In other words you agree that Tarski did "prove" that the
>>>>>>>>> notion of
>>>>>>>>> Truth cannot be fully formalized on a fundamental basis
>>>>>>>>> directly related
>>>>>>>>> to the Liar Paradox?
>>>>>>>>>
>>>>>>>>
>>>>>>>> Only in the sense that since we KNOW the Liar's paradox can't be
>>>>>>>> true, and a "Definition of Truth" (not a "notion of Truth) would
>>>>>>>> lead to being able to prove that the Liar's paradox is true,
>>>>>>>>
>>>>>>>
>>>>>>> That is ridiculous.
>>>>>>>
>>>>>>>
>>>>>>
>>>>>> Why? Do you think the Liar's Paradox should be provable to be True?
>>>>>>
>>>>>
>>>>> The Liar Paradox is not a truth bearer, END-OF-STORY !!!
>>>>
>>>> Right, so why do you fault Tarski for saying that?
>>>>
>>>> His proof shows that if a "Definition of Truth" existed, it provides
>>>> a way to prove the Liar's Paradox is True.
>>> That is a nutty idea.
>>> Any system that proves that a self-contradictory expression is true
>>> is a broken system.
>>
>> Right, and the proof shows that would be any system with a "definition
>> of Truth", so you AGREE with Tarski.
>>
>
> Not at all, Tarski's system is incorrect. All of analytical truth1 is a
> body of semantic tautologies that excludes the liar paradox.

Then why does that "Definition of Truth" PROVE the Liar's Paradox?

If his system is "incorrect" what SPECIFIC step did he do that was
improper? (not conclusion, what STEP).

Your problem is you don't actually understand how logic works.

>
> 1 It is commonly known that analytical truth includes all of math and
> all of logic. My new idea is that it also includes the model of the
> world.

Except since your model doesn't work at all, you have a problem.

>
> Prolog is smart enough to reject the Liar Paradox because it uses the
> same system that I use, only expressions of language that have been
> derived by applying truth preserving operations [Prolog rules] to
> expressions of language that have been stipulated to be true [Prolog
> facts] are true. Everything else [Prolog's negation as failure] counts
> as untrue.

And Prolog is too limited to handle the logic of these proofs.

The fact that you can't understand that just shows how stupid you are.

>
> ?- LP = not(true(LP)).
> LP = not(true(LP)).
>
> ?- unify_with_occurs_check(LP, not(true(LP))).
> false.
>
> The above test shows that LP is infinitely recursive never resolving to
> a truth value.
>
>

Re: Gödel's proof relies on self-contradictory expressions of language

<XrC7M.427054$ZhSc.122673@fx38.iad>

  copy mid

https://www.rocksolidbbs.com/computers/article-flat.php?id=11159&group=comp.ai.philosophy#11159

  copy link   Newsgroups: comp.theory sci.logic comp.ai.philosophy
Path: i2pn2.org!i2pn.org!weretis.net!feeder6.news.weretis.net!usenet.blueworldhosting.com!diablo1.usenet.blueworldhosting.com!peer02.iad!feed-me.highwinds-media.com!news.highwinds-media.com!fx38.iad.POSTED!not-for-mail
MIME-Version: 1.0
User-Agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10.15; rv:102.0)
Gecko/20100101 Thunderbird/102.11.0
Subject: Re:_Gödel's_proof_relies_on_self-contradictory_e
xpressions_of_language
Newsgroups: comp.theory,sci.logic,comp.ai.philosophy
References: <u38nv6$3f467$1@dont-email.me> <u39qvj$3op8a$1@dont-email.me>
<Xr56M.1703155$t5W7.1583576@fx13.iad> <u3b5tt$3trvp$1@dont-email.me>
<_sf6M.2705468$iU59.867750@fx14.iad> <u3cbr5$5cs1$1@dont-email.me>
<9mq6M.361324$rKDc.18371@fx34.iad> <u3dr6t$adhk$1@dont-email.me>
<XXz6M.596198$5CY7.189218@fx46.iad> <u3ens7$dmlj$1@dont-email.me>
<zsC6M.420575$ZnFc.164439@fx41.iad> <u3f0i6$i6bm$1@dont-email.me>
<o9L6M.2991409$vBI8.2430455@fx15.iad> <u3g9k5$n2jk$1@dont-email.me>
<6NV6M.362445$rKDc.280133@fx34.iad> <u3hlqk$vv0u$1@dont-email.me>
<1s47M.2759161$iU59.1670171@fx14.iad> <u3it56$147a9$2@dont-email.me>
<quh7M.3034951$vBI8.187696@fx15.iad> <u3k8it$1clv7$1@dont-email.me>
<LTh7M.1811499$MVg8.828957@fx12.iad> <u3kbsp$1d3i2$1@dont-email.me>
<yDi7M.488122$Sgyc.212125@fx40.iad> <u3kgkr$1dgrj$1@dont-email.me>
<1Kr7M.220169$T%ac.214451@fx01.iad>
<IfGdnWIvve0LyMP5nZ2dnZfqlJ9j4p2d@giganews.com>
<fMv7M.491956$Sgyc.243894@fx40.iad> <u3mco8$1qmer$2@dont-email.me>
From: Richard@Damon-Family.org (Richard Damon)
Content-Language: en-US
In-Reply-To: <u3mco8$1qmer$2@dont-email.me>
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 7bit
Lines: 103
Message-ID: <XrC7M.427054$ZhSc.122673@fx38.iad>
X-Complaints-To: abuse@easynews.com
Organization: Forte - www.forteinc.com
X-Complaints-Info: Please be sure to forward a copy of ALL headers otherwise we will be unable to process your complaint properly.
Date: Fri, 12 May 2023 22:18:32 -0400
X-Received-Bytes: 5323
 by: Richard Damon - Sat, 13 May 2023 02:18 UTC

On 5/12/23 5:57 PM, olcott wrote:
> On 5/12/2023 1:42 PM, Richard Damon wrote:
>> On 5/12/23 11:04 AM, olcott wrote:
>>> On 5/12/2023 9:06 AM, Richard Damon wrote:
>>>> On 5/12/23 12:51 AM, olcott wrote:
>>>>> On 5/11/2023 10:45 PM, Richard Damon wrote:
>>>>>> On 5/11/23 11:30 PM, olcott wrote:
>>>>>>> On 5/11/2023 9:54 PM, Richard Damon wrote:
>>>>>>>> On 5/11/23 10:34 PM, olcott wrote:
>>>>>>>>
>>>>>>>>>> FROM HIS PROOF!
>>>>>>>>>>
>>>>>>>>>> He first does a lot of work to establish a number of properties.
>>>>>>>>> In other words you agree that Tarski did "prove" that the
>>>>>>>>> notion of
>>>>>>>>> Truth cannot be fully formalized on a fundamental basis
>>>>>>>>> directly related
>>>>>>>>> to the Liar Paradox?
>>>>>>>>>
>>>>>>>>
>>>>>>>> Only in the sense that since we KNOW the Liar's paradox can't be
>>>>>>>> true, and a "Definition of Truth" (not a "notion of Truth) would
>>>>>>>> lead to being able to prove that the Liar's paradox is true,
>>>>>>>>
>>>>>>>
>>>>>>> That is ridiculous.
>>>>>>>
>>>>>>>
>>>>>>
>>>>>> Why? Do you think the Liar's Paradox should be provable to be True?
>>>>>>
>>>>>
>>>>> The Liar Paradox is not a truth bearer, END-OF-STORY !!!
>>>>
>>>> Right, so why do you fault Tarski for saying that?
>>>>
>>>> His proof shows that if a "Definition of Truth" existed, it provides
>>>> a way to prove the Liar's Paradox is True.
>>> That is a nutty idea.
>>> Any system that proves that a self-contradictory expression is true
>>> is a broken system.
>>
>> Right, and the proof shows that would be any system with a "definition
>> of Truth", so you AGREE with Tarski.
>>
>
> Not at all, Tarski's system is incorrect. All of analytical truth1 is a
> body of semantic tautologies that excludes the liar paradox.
>
> 1 It is commonly known that analytical truth includes all of math and
> all of logic. My new idea is that it also includes the model of the
> world.
>
>>>
>>> Analytic truth is derived from applying truth preserving operations to
>>> expressions of language that have been stipulated to be true.
>>> This cannot possibly derive non-truth bearers as true.
>>
>> Right, so you agre with Tarksi that there can not be a "Definition of
>> Truth".
>>
>
> Not at all.
>
>>>
>>> Prolog uses the exact same system that I just specified expressions that
>>> are stipulated to be true are Prolog facts with Prolog rules as a set of
>>> truth preserving operations.
>>
>> Prolog is limited in the logic it can do,
>>
>> But, so it seems are you.
>>
>>>
>>> Prolog is smart enough to reject the Liar Paradox.
>>>
>>> ?- LP = not(true(LP)).
>>> LP = not(true(LP)).
>>>
>>> ?- unify_with_occurs_check(LP, not(true(LP))).
>>> false.
>>>
>>> The above test shows that LP is infinitely recursive never resolving
>>> to a truth value.
>>>
>>>
>>
>> So?
>
> Tarski was too stupid (on this one issue) to understand that the Liar
> Paradox is excluded from the body of truth.
>

Why do you say that? WHere does he say what you say he is saying?

Please point out the pont where he is ACCEPTING the Liar's paradox.

The point where the Liar coms up, he uses that fact to point out that
the intial assumption MUST be incorrect, as it lead to proving a
non-true statement.

I think your problem is that you just don't understand the proof you are
reading and reading into it the errors that you yourself make.

Re: Gödel's proof relies on self-contradictory expressions of language

<u3n1cn$20fp0$1@dont-email.me>

  copy mid

https://www.rocksolidbbs.com/computers/article-flat.php?id=11160&group=comp.ai.philosophy#11160

  copy link   Newsgroups: comp.theory sci.logic comp.ai.philosophy
Path: i2pn2.org!i2pn.org!eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail
From: polcott2@gmail.com (olcott)
Newsgroups: comp.theory,sci.logic,comp.ai.philosophy
Subject: Re:_Gödel's_proof_relies_on_self-contradictory_e
xpressions_of_language
Date: Fri, 12 May 2023 22:49:43 -0500
Organization: A noiseless patient Spider
Lines: 115
Message-ID: <u3n1cn$20fp0$1@dont-email.me>
References: <u38nv6$3f467$1@dont-email.me>
<Xr56M.1703155$t5W7.1583576@fx13.iad> <u3b5tt$3trvp$1@dont-email.me>
<_sf6M.2705468$iU59.867750@fx14.iad> <u3cbr5$5cs1$1@dont-email.me>
<9mq6M.361324$rKDc.18371@fx34.iad> <u3dr6t$adhk$1@dont-email.me>
<XXz6M.596198$5CY7.189218@fx46.iad> <u3ens7$dmlj$1@dont-email.me>
<zsC6M.420575$ZnFc.164439@fx41.iad> <u3f0i6$i6bm$1@dont-email.me>
<o9L6M.2991409$vBI8.2430455@fx15.iad> <u3g9k5$n2jk$1@dont-email.me>
<6NV6M.362445$rKDc.280133@fx34.iad> <u3hlqk$vv0u$1@dont-email.me>
<1s47M.2759161$iU59.1670171@fx14.iad> <u3it56$147a9$2@dont-email.me>
<quh7M.3034951$vBI8.187696@fx15.iad> <u3k8it$1clv7$1@dont-email.me>
<LTh7M.1811499$MVg8.828957@fx12.iad> <u3kbsp$1d3i2$1@dont-email.me>
<yDi7M.488122$Sgyc.212125@fx40.iad> <u3kgkr$1dgrj$1@dont-email.me>
<1Kr7M.220169$T%ac.214451@fx01.iad>
<IfGdnWIvve0LyMP5nZ2dnZfqlJ9j4p2d@giganews.com>
<fMv7M.491956$Sgyc.243894@fx40.iad> <u3mkn4$1rle3$1@dont-email.me>
<JrC7M.427053$ZhSc.340319@fx38.iad>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 7bit
Injection-Date: Sat, 13 May 2023 03:49:44 -0000 (UTC)
Injection-Info: dont-email.me; posting-host="007dd2e088d4657e4439604c2261e9bf";
logging-data="2113312"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1/O/DAd6h17trjcfIaBStb6"
User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:102.0) Gecko/20100101
Thunderbird/102.10.1
Cancel-Lock: sha1:ZuX2/by6lYskUdBuJG4K1cLw3Ho=
Content-Language: en-US
In-Reply-To: <JrC7M.427053$ZhSc.340319@fx38.iad>
 by: olcott - Sat, 13 May 2023 03:49 UTC

On 5/12/2023 9:18 PM, Richard Damon wrote:
> On 5/12/23 8:13 PM, olcott wrote:
>> On 5/12/2023 1:42 PM, Richard Damon wrote:
>>> On 5/12/23 11:04 AM, olcott wrote:
>>>> On 5/12/2023 9:06 AM, Richard Damon wrote:
>>>>> On 5/12/23 12:51 AM, olcott wrote:
>>>>>> On 5/11/2023 10:45 PM, Richard Damon wrote:
>>>>>>> On 5/11/23 11:30 PM, olcott wrote:
>>>>>>>> On 5/11/2023 9:54 PM, Richard Damon wrote:
>>>>>>>>> On 5/11/23 10:34 PM, olcott wrote:
>>>>>>>>>
>>>>>>>>>>> FROM HIS PROOF!
>>>>>>>>>>>
>>>>>>>>>>> He first does a lot of work to establish a number of properties.
>>>>>>>>>> In other words you agree that Tarski did "prove" that the
>>>>>>>>>> notion of
>>>>>>>>>> Truth cannot be fully formalized on a fundamental basis
>>>>>>>>>> directly related
>>>>>>>>>> to the Liar Paradox?
>>>>>>>>>>
>>>>>>>>>
>>>>>>>>> Only in the sense that since we KNOW the Liar's paradox can't
>>>>>>>>> be true, and a "Definition of Truth" (not a "notion of Truth)
>>>>>>>>> would lead to being able to prove that the Liar's paradox is true,
>>>>>>>>>
>>>>>>>>
>>>>>>>> That is ridiculous.
>>>>>>>>
>>>>>>>>
>>>>>>>
>>>>>>> Why? Do you think the Liar's Paradox should be provable to be True?
>>>>>>>
>>>>>>
>>>>>> The Liar Paradox is not a truth bearer, END-OF-STORY !!!
>>>>>
>>>>> Right, so why do you fault Tarski for saying that?
>>>>>
>>>>> His proof shows that if a "Definition of Truth" existed, it
>>>>> provides a way to prove the Liar's Paradox is True.
>>>> That is a nutty idea.
>>>> Any system that proves that a self-contradictory expression is true
>>>> is a broken system.
>>>
>>> Right, and the proof shows that would be any system with a
>>> "definition of Truth", so you AGREE with Tarski.
>>>
>>
>> Not at all, Tarski's system is incorrect. All of analytical truth1 is a
>> body of semantic tautologies that excludes the liar paradox.
>
> Then why does that "Definition of Truth" PROVE the Liar's Paradox?
>
> If his system is "incorrect" what SPECIFIC step did he do that was
> improper? (not conclusion, what STEP).
>

The step where he used the Liar Paradox as the basis of his proof.

> Your problem is you don't actually understand how logic works.
>

My problem is that others do not understand the philosophical
foundations of logic as deeply as I do, they merely follow what they
read in a textbook as if it was the infallible word of God.

>>
>> 1 It is commonly known that analytical truth includes all of math and
>> all of logic. My new idea is that it also includes the model of the
>> world.
>
> Except since your model doesn't work at all, you have a problem.

When-so-ever an expression of language is derived by applying only truth
preserving operations to expressions of language that have been
stipulated to be true we are guaranteed that this expression is true.

>
>>
>> Prolog is smart enough to reject the Liar Paradox because it uses the
>> same system that I use, only expressions of language that have been
>> derived by applying truth preserving operations [Prolog rules] to
>> expressions of language that have been stipulated to be true [Prolog
>> facts] are true. Everything else [Prolog's negation as failure] counts
>> as untrue.
>
> And Prolog is too limited to handle the logic of these proofs.
>

It is not in fact too limited to handle these proofs as I have
concretely proved. I invented Minimal Type Theory that translates logic
expressions into directed graphs and a cycle in the graph indicates the
expression never resolves to a truth value.

Prolog simply does this same thing.

> The fact that you can't understand that just shows how stupid you are.
>
>>
>> ?- LP = not(true(LP)).
>> LP = not(true(LP)).
>>
>> ?- unify_with_occurs_check(LP, not(true(LP))).
>> false.
>>
>> The above test shows that LP is infinitely recursive never resolving
>> to a truth value.
>>
>>
>
>

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

Re: Gödel's proof relies on self-contradictory expressions of language

<U5M7M.23491$i7t3.3288@fx08.iad>

  copy mid

https://www.rocksolidbbs.com/computers/article-flat.php?id=11161&group=comp.ai.philosophy#11161

  copy link   Newsgroups: comp.theory sci.logic comp.ai.philosophy
Path: i2pn2.org!i2pn.org!weretis.net!feeder8.news.weretis.net!feeder1.feed.usenet.farm!feed.usenet.farm!peer02.ams4!peer.am4.highwinds-media.com!peer02.iad!feed-me.highwinds-media.com!news.highwinds-media.com!fx08.iad.POSTED!not-for-mail
MIME-Version: 1.0
User-Agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10.15; rv:102.0)
Gecko/20100101 Thunderbird/102.11.0
Subject: Re:_Gödel's_proof_relies_on_self-contradictory_e
xpressions_of_language
Newsgroups: comp.theory,sci.logic,comp.ai.philosophy
References: <u38nv6$3f467$1@dont-email.me> <u3b5tt$3trvp$1@dont-email.me>
<_sf6M.2705468$iU59.867750@fx14.iad> <u3cbr5$5cs1$1@dont-email.me>
<9mq6M.361324$rKDc.18371@fx34.iad> <u3dr6t$adhk$1@dont-email.me>
<XXz6M.596198$5CY7.189218@fx46.iad> <u3ens7$dmlj$1@dont-email.me>
<zsC6M.420575$ZnFc.164439@fx41.iad> <u3f0i6$i6bm$1@dont-email.me>
<o9L6M.2991409$vBI8.2430455@fx15.iad> <u3g9k5$n2jk$1@dont-email.me>
<6NV6M.362445$rKDc.280133@fx34.iad> <u3hlqk$vv0u$1@dont-email.me>
<1s47M.2759161$iU59.1670171@fx14.iad> <u3it56$147a9$2@dont-email.me>
<quh7M.3034951$vBI8.187696@fx15.iad> <u3k8it$1clv7$1@dont-email.me>
<LTh7M.1811499$MVg8.828957@fx12.iad> <u3kbsp$1d3i2$1@dont-email.me>
<yDi7M.488122$Sgyc.212125@fx40.iad> <u3kgkr$1dgrj$1@dont-email.me>
<1Kr7M.220169$T%ac.214451@fx01.iad>
<IfGdnWIvve0LyMP5nZ2dnZfqlJ9j4p2d@giganews.com>
<fMv7M.491956$Sgyc.243894@fx40.iad> <u3mkn4$1rle3$1@dont-email.me>
<JrC7M.427053$ZhSc.340319@fx38.iad> <u3n1cn$20fp0$1@dont-email.me>
From: Richard@Damon-Family.org (Richard Damon)
Content-Language: en-US
In-Reply-To: <u3n1cn$20fp0$1@dont-email.me>
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 7bit
Lines: 132
Message-ID: <U5M7M.23491$i7t3.3288@fx08.iad>
X-Complaints-To: abuse@easynews.com
Organization: Forte - www.forteinc.com
X-Complaints-Info: Please be sure to forward a copy of ALL headers otherwise we will be unable to process your complaint properly.
Date: Sat, 13 May 2023 09:17:42 -0400
X-Received-Bytes: 6795
 by: Richard Damon - Sat, 13 May 2023 13:17 UTC

On 5/12/23 11:49 PM, olcott wrote:
> On 5/12/2023 9:18 PM, Richard Damon wrote:
>> On 5/12/23 8:13 PM, olcott wrote:
>>> On 5/12/2023 1:42 PM, Richard Damon wrote:
>>>> On 5/12/23 11:04 AM, olcott wrote:
>>>>> On 5/12/2023 9:06 AM, Richard Damon wrote:
>>>>>> On 5/12/23 12:51 AM, olcott wrote:
>>>>>>> On 5/11/2023 10:45 PM, Richard Damon wrote:
>>>>>>>> On 5/11/23 11:30 PM, olcott wrote:
>>>>>>>>> On 5/11/2023 9:54 PM, Richard Damon wrote:
>>>>>>>>>> On 5/11/23 10:34 PM, olcott wrote:
>>>>>>>>>>
>>>>>>>>>>>> FROM HIS PROOF!
>>>>>>>>>>>>
>>>>>>>>>>>> He first does a lot of work to establish a number of
>>>>>>>>>>>> properties.
>>>>>>>>>>> In other words you agree that Tarski did "prove" that the
>>>>>>>>>>> notion of
>>>>>>>>>>> Truth cannot be fully formalized on a fundamental basis
>>>>>>>>>>> directly related
>>>>>>>>>>> to the Liar Paradox?
>>>>>>>>>>>
>>>>>>>>>>
>>>>>>>>>> Only in the sense that since we KNOW the Liar's paradox can't
>>>>>>>>>> be true, and a "Definition of Truth" (not a "notion of Truth)
>>>>>>>>>> would lead to being able to prove that the Liar's paradox is
>>>>>>>>>> true,
>>>>>>>>>>
>>>>>>>>>
>>>>>>>>> That is ridiculous.
>>>>>>>>>
>>>>>>>>>
>>>>>>>>
>>>>>>>> Why? Do you think the Liar's Paradox should be provable to be True?
>>>>>>>>
>>>>>>>
>>>>>>> The Liar Paradox is not a truth bearer, END-OF-STORY !!!
>>>>>>
>>>>>> Right, so why do you fault Tarski for saying that?
>>>>>>
>>>>>> His proof shows that if a "Definition of Truth" existed, it
>>>>>> provides a way to prove the Liar's Paradox is True.
>>>>> That is a nutty idea.
>>>>> Any system that proves that a self-contradictory expression is true
>>>>> is a broken system.
>>>>
>>>> Right, and the proof shows that would be any system with a
>>>> "definition of Truth", so you AGREE with Tarski.
>>>>
>>>
>>> Not at all, Tarski's system is incorrect. All of analytical truth1 is a
>>> body of semantic tautologies that excludes the liar paradox.
>>
>> Then why does that "Definition of Truth" PROVE the Liar's Paradox?
>>
>> If his system is "incorrect" what SPECIFIC step did he do that was
>> improper? (not conclusion, what STEP).
>>
>
> The step where he used the Liar Paradox as the basis of his proof.
>
>> Your problem is you don't actually understand how logic works.
>>
>
> My problem is that others do not understand the philosophical
> foundations of logic as deeply as I do, they merely follow what they
> read in a textbook as if it was the infallible word of God.
>
>>>
>>> 1 It is commonly known that analytical truth includes all of math and
>>> all of logic. My new idea is that it also includes the model of the
>>> world.
>>
>> Except since your model doesn't work at all, you have a problem.
>
> When-so-ever an expression of language is derived by applying only truth
> preserving operations to expressions of language that have been
> stipulated to be true we are guaranteed that this expression is true.
>
>>
>>>
>>> Prolog is smart enough to reject the Liar Paradox because it uses the
>>> same system that I use, only expressions of language that have been
>>> derived by applying truth preserving operations [Prolog rules] to
>>> expressions of language that have been stipulated to be true [Prolog
>>> facts] are true. Everything else [Prolog's negation as failure] counts
>>> as untrue.
>>
>> And Prolog is too limited to handle the logic of these proofs.
>>
>
> It is not in fact too limited to handle these proofs as I have
> concretely proved. I invented Minimal Type Theory that translates logic
> expressions into directed graphs and a cycle in the graph indicates the
> expression never resolves to a truth value.

Then your logic is too simple to handle the needed logic.

Prolog only does FIRST order logic, and not all of it.

The logic used here is at least Second order, so out of the reach of Prolog.

If you want to claim differently, show how Prolog verifies a proof of
the Pythagorean Theorem.

In fact, almost all of the examples you actaully try to run with are
down at the simple level of Categorical logic which only handles things
of one super-class divided into sub-classes. That logic is way to simple
to handle the things the theorems have been talking about. My guess is
that is as complicated of logic that you can understand, so you try to
force everything into it, and FAIL.

>
> Prolog simply does this same thing.
>
>> The fact that you can't understand that just shows how stupid you are.
>>
>>>
>>> ?- LP = not(true(LP)).
>>> LP = not(true(LP)).
>>>
>>> ?- unify_with_occurs_check(LP, not(true(LP))).
>>> false.
>>>
>>> The above test shows that LP is infinitely recursive never resolving
>>> to a truth value.
>>>
>>>
>>
>>
>

Re: Gödel's proof relies on self-contradictory expressions of language

<u3o8nf$24mqh$1@dont-email.me>

  copy mid

https://www.rocksolidbbs.com/computers/article-flat.php?id=11162&group=comp.ai.philosophy#11162

  copy link   Newsgroups: comp.theory sci.logic comp.ai.philosophy
Path: i2pn2.org!i2pn.org!eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail
From: polcott2@gmail.com (olcott)
Newsgroups: comp.theory,sci.logic,comp.ai.philosophy
Subject: Re:_Gödel's_proof_relies_on_self-contradictory_e
xpressions_of_language
Date: Sat, 13 May 2023 10:01:01 -0500
Organization: A noiseless patient Spider
Lines: 144
Message-ID: <u3o8nf$24mqh$1@dont-email.me>
References: <u38nv6$3f467$1@dont-email.me> <u3b5tt$3trvp$1@dont-email.me>
<_sf6M.2705468$iU59.867750@fx14.iad> <u3cbr5$5cs1$1@dont-email.me>
<9mq6M.361324$rKDc.18371@fx34.iad> <u3dr6t$adhk$1@dont-email.me>
<XXz6M.596198$5CY7.189218@fx46.iad> <u3ens7$dmlj$1@dont-email.me>
<zsC6M.420575$ZnFc.164439@fx41.iad> <u3f0i6$i6bm$1@dont-email.me>
<o9L6M.2991409$vBI8.2430455@fx15.iad> <u3g9k5$n2jk$1@dont-email.me>
<6NV6M.362445$rKDc.280133@fx34.iad> <u3hlqk$vv0u$1@dont-email.me>
<1s47M.2759161$iU59.1670171@fx14.iad> <u3it56$147a9$2@dont-email.me>
<quh7M.3034951$vBI8.187696@fx15.iad> <u3k8it$1clv7$1@dont-email.me>
<LTh7M.1811499$MVg8.828957@fx12.iad> <u3kbsp$1d3i2$1@dont-email.me>
<yDi7M.488122$Sgyc.212125@fx40.iad> <u3kgkr$1dgrj$1@dont-email.me>
<1Kr7M.220169$T%ac.214451@fx01.iad>
<IfGdnWIvve0LyMP5nZ2dnZfqlJ9j4p2d@giganews.com>
<fMv7M.491956$Sgyc.243894@fx40.iad> <u3mkn4$1rle3$1@dont-email.me>
<JrC7M.427053$ZhSc.340319@fx38.iad> <u3n1cn$20fp0$1@dont-email.me>
<U5M7M.23491$i7t3.3288@fx08.iad>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 7bit
Injection-Date: Sat, 13 May 2023 15:01:03 -0000 (UTC)
Injection-Info: dont-email.me; posting-host="007dd2e088d4657e4439604c2261e9bf";
logging-data="2251601"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX18M+mfb7IM79LYvecePgNXr"
User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:102.0) Gecko/20100101
Thunderbird/102.10.1
Cancel-Lock: sha1:kZKA/Pswhp2vd4xnjeUIw2l6qv0=
In-Reply-To: <U5M7M.23491$i7t3.3288@fx08.iad>
Content-Language: en-US
 by: olcott - Sat, 13 May 2023 15:01 UTC

On 5/13/2023 8:17 AM, Richard Damon wrote:
> On 5/12/23 11:49 PM, olcott wrote:
>> On 5/12/2023 9:18 PM, Richard Damon wrote:
>>> On 5/12/23 8:13 PM, olcott wrote:
>>>> On 5/12/2023 1:42 PM, Richard Damon wrote:
>>>>> On 5/12/23 11:04 AM, olcott wrote:
>>>>>> On 5/12/2023 9:06 AM, Richard Damon wrote:
>>>>>>> On 5/12/23 12:51 AM, olcott wrote:
>>>>>>>> On 5/11/2023 10:45 PM, Richard Damon wrote:
>>>>>>>>> On 5/11/23 11:30 PM, olcott wrote:
>>>>>>>>>> On 5/11/2023 9:54 PM, Richard Damon wrote:
>>>>>>>>>>> On 5/11/23 10:34 PM, olcott wrote:
>>>>>>>>>>>
>>>>>>>>>>>>> FROM HIS PROOF!
>>>>>>>>>>>>>
>>>>>>>>>>>>> He first does a lot of work to establish a number of
>>>>>>>>>>>>> properties.
>>>>>>>>>>>> In other words you agree that Tarski did "prove" that the
>>>>>>>>>>>> notion of
>>>>>>>>>>>> Truth cannot be fully formalized on a fundamental basis
>>>>>>>>>>>> directly related
>>>>>>>>>>>> to the Liar Paradox?
>>>>>>>>>>>>
>>>>>>>>>>>
>>>>>>>>>>> Only in the sense that since we KNOW the Liar's paradox can't
>>>>>>>>>>> be true, and a "Definition of Truth" (not a "notion of Truth)
>>>>>>>>>>> would lead to being able to prove that the Liar's paradox is
>>>>>>>>>>> true,
>>>>>>>>>>>
>>>>>>>>>>
>>>>>>>>>> That is ridiculous.
>>>>>>>>>>
>>>>>>>>>>
>>>>>>>>>
>>>>>>>>> Why? Do you think the Liar's Paradox should be provable to be
>>>>>>>>> True?
>>>>>>>>>
>>>>>>>>
>>>>>>>> The Liar Paradox is not a truth bearer, END-OF-STORY !!!
>>>>>>>
>>>>>>> Right, so why do you fault Tarski for saying that?
>>>>>>>
>>>>>>> His proof shows that if a "Definition of Truth" existed, it
>>>>>>> provides a way to prove the Liar's Paradox is True.
>>>>>> That is a nutty idea.
>>>>>> Any system that proves that a self-contradictory expression is
>>>>>> true is a broken system.
>>>>>
>>>>> Right, and the proof shows that would be any system with a
>>>>> "definition of Truth", so you AGREE with Tarski.
>>>>>
>>>>
>>>> Not at all, Tarski's system is incorrect. All of analytical truth1 is a
>>>> body of semantic tautologies that excludes the liar paradox.
>>>
>>> Then why does that "Definition of Truth" PROVE the Liar's Paradox?
>>>
>>> If his system is "incorrect" what SPECIFIC step did he do that was
>>> improper? (not conclusion, what STEP).
>>>
>>
>> The step where he used the Liar Paradox as the basis of his proof.
>>
>>> Your problem is you don't actually understand how logic works.
>>>
>>
>> My problem is that others do not understand the philosophical
>> foundations of logic as deeply as I do, they merely follow what they
>> read in a textbook as if it was the infallible word of God.
>>
>>>>
>>>> 1 It is commonly known that analytical truth includes all of math and
>>>> all of logic. My new idea is that it also includes the model of the
>>>> world.
>>>
>>> Except since your model doesn't work at all, you have a problem.
>>
>> When-so-ever an expression of language is derived by applying only truth
>> preserving operations to expressions of language that have been
>> stipulated to be true we are guaranteed that this expression is true.
>>
>>>
>>>>
>>>> Prolog is smart enough to reject the Liar Paradox because it uses the
>>>> same system that I use, only expressions of language that have been
>>>> derived by applying truth preserving operations [Prolog rules] to
>>>> expressions of language that have been stipulated to be true [Prolog
>>>> facts] are true. Everything else [Prolog's negation as failure] counts
>>>> as untrue.
>>>
>>> And Prolog is too limited to handle the logic of these proofs.
>>>
>>
>> It is not in fact too limited to handle these proofs as I have
>> concretely proved. I invented Minimal Type Theory that translates logic
>> expressions into directed graphs and a cycle in the graph indicates the
>> expression never resolves to a truth value.
>
> Then your logic is too simple to handle the needed logic.
>
> Prolog only does FIRST order logic, and not all of it.
>
> The logic used here is at least Second order, so out of the reach of
> Prolog.
>
> If you want to claim differently, show how Prolog verifies a proof of
> the Pythagorean Theorem.
>
> In fact, almost all of the examples you actaully try to run with are
> down at the simple level of Categorical logic which only handles things
> of one super-class divided into sub-classes. That logic is way to simple
> to handle the things the theorems have been talking about. My guess is
> that is as complicated of logic that you can understand, so you try to
> force everything into it, and FAIL.
>

Please explain this in English:

?- LP = not(true(LP)).
LP = not(true(LP)).

?- unify_with_occurs_check(LP, not(true(LP))).
false.

ChatGPT
The first statement in Prolog is an assignment where LP is defined as
the negation of the truth value of LP itself. This means that LP is the
logical negation of LP, indicating that LP is false if it is true, and
true if it is false.

The second statement is a query that checks if there exists a
unification between LP and not(true(LP)). It attempts to find a
consistent value for LP that satisfies the equation.

In this case, the result of the query is false, indicating that there is
no valid unification between LP and not(true(LP)). In other words, there
is no consistent value that can simultaneously satisfy the equation LP =
not(true(LP)). This suggests that there is a contradiction in the logic,
as the equation cannot hold true for any value of LP.

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

Re: Gödel's proof relies on self-contradictory expressions of language

<DnS7M.2806827$iU59.2472546@fx14.iad>

  copy mid

https://www.rocksolidbbs.com/computers/article-flat.php?id=11163&group=comp.ai.philosophy#11163

  copy link   Newsgroups: comp.theory sci.logic comp.ai.philosophy
Path: i2pn2.org!i2pn.org!weretis.net!feeder8.news.weretis.net!feeder1.feed.usenet.farm!feed.usenet.farm!peer02.ams4!peer.am4.highwinds-media.com!peer03.iad!feed-me.highwinds-media.com!news.highwinds-media.com!fx14.iad.POSTED!not-for-mail
MIME-Version: 1.0
User-Agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10.15; rv:102.0)
Gecko/20100101 Thunderbird/102.11.0
Subject: Re:_Gödel's_proof_relies_on_self-contradictory_e
xpressions_of_language
Newsgroups: comp.theory,sci.logic,comp.ai.philosophy
References: <u38nv6$3f467$1@dont-email.me>
<_sf6M.2705468$iU59.867750@fx14.iad> <u3cbr5$5cs1$1@dont-email.me>
<9mq6M.361324$rKDc.18371@fx34.iad> <u3dr6t$adhk$1@dont-email.me>
<XXz6M.596198$5CY7.189218@fx46.iad> <u3ens7$dmlj$1@dont-email.me>
<zsC6M.420575$ZnFc.164439@fx41.iad> <u3f0i6$i6bm$1@dont-email.me>
<o9L6M.2991409$vBI8.2430455@fx15.iad> <u3g9k5$n2jk$1@dont-email.me>
<6NV6M.362445$rKDc.280133@fx34.iad> <u3hlqk$vv0u$1@dont-email.me>
<1s47M.2759161$iU59.1670171@fx14.iad> <u3it56$147a9$2@dont-email.me>
<quh7M.3034951$vBI8.187696@fx15.iad> <u3k8it$1clv7$1@dont-email.me>
<LTh7M.1811499$MVg8.828957@fx12.iad> <u3kbsp$1d3i2$1@dont-email.me>
<yDi7M.488122$Sgyc.212125@fx40.iad> <u3kgkr$1dgrj$1@dont-email.me>
<1Kr7M.220169$T%ac.214451@fx01.iad>
<IfGdnWIvve0LyMP5nZ2dnZfqlJ9j4p2d@giganews.com>
<fMv7M.491956$Sgyc.243894@fx40.iad> <u3mkn4$1rle3$1@dont-email.me>
<JrC7M.427053$ZhSc.340319@fx38.iad> <u3n1cn$20fp0$1@dont-email.me>
<U5M7M.23491$i7t3.3288@fx08.iad> <u3o8nf$24mqh$1@dont-email.me>
From: Richard@Damon-Family.org (Richard Damon)
Content-Language: en-US
In-Reply-To: <u3o8nf$24mqh$1@dont-email.me>
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 7bit
Lines: 161
Message-ID: <DnS7M.2806827$iU59.2472546@fx14.iad>
X-Complaints-To: abuse@easynews.com
Organization: Forte - www.forteinc.com
X-Complaints-Info: Please be sure to forward a copy of ALL headers otherwise we will be unable to process your complaint properly.
Date: Sat, 13 May 2023 16:26:11 -0400
X-Received-Bytes: 8409
 by: Richard Damon - Sat, 13 May 2023 20:26 UTC

On 5/13/23 11:01 AM, olcott wrote:
> On 5/13/2023 8:17 AM, Richard Damon wrote:
>> On 5/12/23 11:49 PM, olcott wrote:
>>> On 5/12/2023 9:18 PM, Richard Damon wrote:
>>>> On 5/12/23 8:13 PM, olcott wrote:
>>>>> On 5/12/2023 1:42 PM, Richard Damon wrote:
>>>>>> On 5/12/23 11:04 AM, olcott wrote:
>>>>>>> On 5/12/2023 9:06 AM, Richard Damon wrote:
>>>>>>>> On 5/12/23 12:51 AM, olcott wrote:
>>>>>>>>> On 5/11/2023 10:45 PM, Richard Damon wrote:
>>>>>>>>>> On 5/11/23 11:30 PM, olcott wrote:
>>>>>>>>>>> On 5/11/2023 9:54 PM, Richard Damon wrote:
>>>>>>>>>>>> On 5/11/23 10:34 PM, olcott wrote:
>>>>>>>>>>>>
>>>>>>>>>>>>>> FROM HIS PROOF!
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> He first does a lot of work to establish a number of
>>>>>>>>>>>>>> properties.
>>>>>>>>>>>>> In other words you agree that Tarski did "prove" that the
>>>>>>>>>>>>> notion of
>>>>>>>>>>>>> Truth cannot be fully formalized on a fundamental basis
>>>>>>>>>>>>> directly related
>>>>>>>>>>>>> to the Liar Paradox?
>>>>>>>>>>>>>
>>>>>>>>>>>>
>>>>>>>>>>>> Only in the sense that since we KNOW the Liar's paradox
>>>>>>>>>>>> can't be true, and a "Definition of Truth" (not a "notion of
>>>>>>>>>>>> Truth) would lead to being able to prove that the Liar's
>>>>>>>>>>>> paradox is true,
>>>>>>>>>>>>
>>>>>>>>>>>
>>>>>>>>>>> That is ridiculous.
>>>>>>>>>>>
>>>>>>>>>>>
>>>>>>>>>>
>>>>>>>>>> Why? Do you think the Liar's Paradox should be provable to be
>>>>>>>>>> True?
>>>>>>>>>>
>>>>>>>>>
>>>>>>>>> The Liar Paradox is not a truth bearer, END-OF-STORY !!!
>>>>>>>>
>>>>>>>> Right, so why do you fault Tarski for saying that?
>>>>>>>>
>>>>>>>> His proof shows that if a "Definition of Truth" existed, it
>>>>>>>> provides a way to prove the Liar's Paradox is True.
>>>>>>> That is a nutty idea.
>>>>>>> Any system that proves that a self-contradictory expression is
>>>>>>> true is a broken system.
>>>>>>
>>>>>> Right, and the proof shows that would be any system with a
>>>>>> "definition of Truth", so you AGREE with Tarski.
>>>>>>
>>>>>
>>>>> Not at all, Tarski's system is incorrect. All of analytical truth1
>>>>> is a
>>>>> body of semantic tautologies that excludes the liar paradox.
>>>>
>>>> Then why does that "Definition of Truth" PROVE the Liar's Paradox?
>>>>
>>>> If his system is "incorrect" what SPECIFIC step did he do that was
>>>> improper? (not conclusion, what STEP).
>>>>
>>>
>>> The step where he used the Liar Paradox as the basis of his proof.
>>>
>>>> Your problem is you don't actually understand how logic works.
>>>>
>>>
>>> My problem is that others do not understand the philosophical
>>> foundations of logic as deeply as I do, they merely follow what they
>>> read in a textbook as if it was the infallible word of God.
>>>
>>>>>
>>>>> 1 It is commonly known that analytical truth includes all of math and
>>>>> all of logic. My new idea is that it also includes the model of the
>>>>> world.
>>>>
>>>> Except since your model doesn't work at all, you have a problem.
>>>
>>> When-so-ever an expression of language is derived by applying only truth
>>> preserving operations to expressions of language that have been
>>> stipulated to be true we are guaranteed that this expression is true.
>>>
>>>>
>>>>>
>>>>> Prolog is smart enough to reject the Liar Paradox because it uses the
>>>>> same system that I use, only expressions of language that have been
>>>>> derived by applying truth preserving operations [Prolog rules] to
>>>>> expressions of language that have been stipulated to be true [Prolog
>>>>> facts] are true. Everything else [Prolog's negation as failure] counts
>>>>> as untrue.
>>>>
>>>> And Prolog is too limited to handle the logic of these proofs.
>>>>
>>>
>>> It is not in fact too limited to handle these proofs as I have
>>> concretely proved. I invented Minimal Type Theory that translates logic
>>> expressions into directed graphs and a cycle in the graph indicates the
>>> expression never resolves to a truth value.
>>
>> Then your logic is too simple to handle the needed logic.
>>
>> Prolog only does FIRST order logic, and not all of it.
>>
>> The logic used here is at least Second order, so out of the reach of
>> Prolog.
>>
>> If you want to claim differently, show how Prolog verifies a proof of
>> the Pythagorean Theorem.
>>
>> In fact, almost all of the examples you actaully try to run with are
>> down at the simple level of Categorical logic which only handles
>> things of one super-class divided into sub-classes. That logic is way
>> to simple to handle the things the theorems have been talking about.
>> My guess is that is as complicated of logic that you can understand,
>> so you try to force everything into it, and FAIL.
>>
>
> Please explain this in English:
>
> ?- LP = not(true(LP)).
> LP = not(true(LP)).
>
> ?- unify_with_occurs_check(LP, not(true(LP))).
> false.
>
> ChatGPT
> The first statement in Prolog is an assignment where LP is defined as
> the negation of the truth value of LP itself. This means that LP is the
> logical negation of LP, indicating that LP is false if it is true, and
> true if it is false.
>
> The second statement is a query that checks if there exists a
> unification between LP and not(true(LP)). It attempts to find a
> consistent value for LP that satisfies the equation.
>
> In this case, the result of the query is false, indicating that there is
> no valid unification between LP and not(true(LP)). In other words, there
> is no consistent value that can simultaneously satisfy the equation LP =
> not(true(LP)). This suggests that there is a contradiction in the logic,
> as the equation cannot hold true for any value of LP.
>

So?

the Liar's paradox is built on very simple logic.

I don't diagree that the Liar's Paradox is a non-truth-bearer, and the
fact that you keep arguing about it just shows how little you understand
about the conversation you are having.

Prolog is incapable of handling the level of logic needed to handle
Tarski or Godel, and since your understanding of Logic seems to be no
better than Prolog, you can't handle them either.

You are just confirming your utter stupidity and ignorance about all of
this.

What did any of what ChatGPT say that negates my comments.

You are just proving your stupidity.

Re: Gödel's proof relies on self-contradictory expressions of language

<u3oru6$2auuq$1@dont-email.me>

  copy mid

https://www.rocksolidbbs.com/computers/article-flat.php?id=11164&group=comp.ai.philosophy#11164

  copy link   Newsgroups: comp.theory sci.logic comp.ai.philosophy
Path: i2pn2.org!i2pn.org!eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail
From: polcott2@gmail.com (olcott)
Newsgroups: comp.theory,sci.logic,comp.ai.philosophy
Subject: Re:_Gödel's_proof_relies_on_self-contradictory_e
xpressions_of_language
Date: Sat, 13 May 2023 15:28:54 -0500
Organization: A noiseless patient Spider
Lines: 118
Message-ID: <u3oru6$2auuq$1@dont-email.me>
References: <u38nv6$3f467$1@dont-email.me>
<Xr56M.1703155$t5W7.1583576@fx13.iad> <u3b5tt$3trvp$1@dont-email.me>
<_sf6M.2705468$iU59.867750@fx14.iad> <u3cbr5$5cs1$1@dont-email.me>
<9mq6M.361324$rKDc.18371@fx34.iad> <u3dr6t$adhk$1@dont-email.me>
<XXz6M.596198$5CY7.189218@fx46.iad> <u3ens7$dmlj$1@dont-email.me>
<zsC6M.420575$ZnFc.164439@fx41.iad> <u3f0i6$i6bm$1@dont-email.me>
<o9L6M.2991409$vBI8.2430455@fx15.iad> <u3g9k5$n2jk$1@dont-email.me>
<6NV6M.362445$rKDc.280133@fx34.iad> <u3hlqk$vv0u$1@dont-email.me>
<1s47M.2759161$iU59.1670171@fx14.iad> <u3it56$147a9$2@dont-email.me>
<quh7M.3034951$vBI8.187696@fx15.iad> <u3k8it$1clv7$1@dont-email.me>
<LTh7M.1811499$MVg8.828957@fx12.iad> <u3kbsp$1d3i2$1@dont-email.me>
<yDi7M.488122$Sgyc.212125@fx40.iad> <u3kgkr$1dgrj$1@dont-email.me>
<1Kr7M.220169$T%ac.214451@fx01.iad>
<IfGdnWIvve0LyMP5nZ2dnZfqlJ9j4p2d@giganews.com>
<fMv7M.491956$Sgyc.243894@fx40.iad> <u3mco8$1qmer$2@dont-email.me>
<XrC7M.427054$ZhSc.122673@fx38.iad>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 7bit
Injection-Date: Sat, 13 May 2023 20:28:54 -0000 (UTC)
Injection-Info: dont-email.me; posting-host="007dd2e088d4657e4439604c2261e9bf";
logging-data="2456538"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX19S1VJazy/SsRVdB1UaDiGt"
User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:102.0) Gecko/20100101
Thunderbird/102.10.1
Cancel-Lock: sha1:ZNIaCDAOOJnEBObdYKqwT9xfy00=
Content-Language: en-US
In-Reply-To: <XrC7M.427054$ZhSc.122673@fx38.iad>
 by: olcott - Sat, 13 May 2023 20:28 UTC

On 5/12/2023 9:18 PM, Richard Damon wrote:
> On 5/12/23 5:57 PM, olcott wrote:
>> On 5/12/2023 1:42 PM, Richard Damon wrote:
>>> On 5/12/23 11:04 AM, olcott wrote:
>>>> On 5/12/2023 9:06 AM, Richard Damon wrote:
>>>>> On 5/12/23 12:51 AM, olcott wrote:
>>>>>> On 5/11/2023 10:45 PM, Richard Damon wrote:
>>>>>>> On 5/11/23 11:30 PM, olcott wrote:
>>>>>>>> On 5/11/2023 9:54 PM, Richard Damon wrote:
>>>>>>>>> On 5/11/23 10:34 PM, olcott wrote:
>>>>>>>>>
>>>>>>>>>>> FROM HIS PROOF!
>>>>>>>>>>>
>>>>>>>>>>> He first does a lot of work to establish a number of properties.
>>>>>>>>>> In other words you agree that Tarski did "prove" that the
>>>>>>>>>> notion of
>>>>>>>>>> Truth cannot be fully formalized on a fundamental basis
>>>>>>>>>> directly related
>>>>>>>>>> to the Liar Paradox?
>>>>>>>>>>
>>>>>>>>>
>>>>>>>>> Only in the sense that since we KNOW the Liar's paradox can't
>>>>>>>>> be true, and a "Definition of Truth" (not a "notion of Truth)
>>>>>>>>> would lead to being able to prove that the Liar's paradox is true,
>>>>>>>>>
>>>>>>>>
>>>>>>>> That is ridiculous.
>>>>>>>>
>>>>>>>>
>>>>>>>
>>>>>>> Why? Do you think the Liar's Paradox should be provable to be True?
>>>>>>>
>>>>>>
>>>>>> The Liar Paradox is not a truth bearer, END-OF-STORY !!!
>>>>>
>>>>> Right, so why do you fault Tarski for saying that?
>>>>>
>>>>> His proof shows that if a "Definition of Truth" existed, it
>>>>> provides a way to prove the Liar's Paradox is True.
>>>> That is a nutty idea.
>>>> Any system that proves that a self-contradictory expression is true
>>>> is a broken system.
>>>
>>> Right, and the proof shows that would be any system with a
>>> "definition of Truth", so you AGREE with Tarski.
>>>
>>
>> Not at all, Tarski's system is incorrect. All of analytical truth1 is a
>> body of semantic tautologies that excludes the liar paradox.
>>
>> 1 It is commonly known that analytical truth includes all of math and
>> all of logic. My new idea is that it also includes the model of the
>> world.
>>
>>>>
>>>> Analytic truth is derived from applying truth preserving operations to
>>>> expressions of language that have been stipulated to be true.
>>>> This cannot possibly derive non-truth bearers as true.
>>>
>>> Right, so you agre with Tarksi that there can not be a "Definition of
>>> Truth".
>>>
>>
>> Not at all.
>>
>>>>
>>>> Prolog uses the exact same system that I just specified expressions
>>>> that
>>>> are stipulated to be true are Prolog facts with Prolog rules as a
>>>> set of
>>>> truth preserving operations.
>>>
>>> Prolog is limited in the logic it can do,
>>>
>>> But, so it seems are you.
>>>
>>>>
>>>> Prolog is smart enough to reject the Liar Paradox.
>>>>
>>>> ?- LP = not(true(LP)).
>>>> LP = not(true(LP)).
>>>>
>>>> ?- unify_with_occurs_check(LP, not(true(LP))).
>>>> false.
>>>>
>>>> The above test shows that LP is infinitely recursive never resolving
>>>> to a truth value.
>>>>
>>>>
>>>
>>> So?
>>
>> Tarski was too stupid (on this one issue) to understand that the Liar
>> Paradox is excluded from the body of truth.
>>
>
> Why do you say that? WHere does he say what you say he is saying?
>
> Please point out the pont where he is ACCEPTING the Liar's paradox.
>
> The point where the Liar coms up, he uses that fact to point out that
> the intial assumption MUST be incorrect, as it lead to proving a
> non-true statement.
>
> I think your problem is that you just don't understand the proof you are
> reading and reading into it the errors that you yourself make.

Anyone that uses the Liar Paradox as any basis for showing the
properties of truth has committed a category error1, the Liar Paradox is
excluded from the category of truth.

1 Flibble's key insight

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

Re: Gödel's proof relies on self-contradictory expressions of language

<OyS7M.620275$5CY7.577133@fx46.iad>

  copy mid

https://www.rocksolidbbs.com/computers/article-flat.php?id=11165&group=comp.ai.philosophy#11165

  copy link   Newsgroups: comp.theory sci.logic comp.ai.philosophy
Path: i2pn2.org!i2pn.org!weretis.net!feeder8.news.weretis.net!newsreader4.netcologne.de!news.netcologne.de!peer02.ams1!peer.ams1.xlned.com!news.xlned.com!peer03.iad!feed-me.highwinds-media.com!news.highwinds-media.com!fx46.iad.POSTED!not-for-mail
MIME-Version: 1.0
User-Agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10.15; rv:102.0)
Gecko/20100101 Thunderbird/102.11.0
Subject: Re:_Gödel's_proof_relies_on_self-contradictory_e
xpressions_of_language
Content-Language: en-US
Newsgroups: comp.theory,sci.logic,comp.ai.philosophy
References: <u38nv6$3f467$1@dont-email.me> <u3b5tt$3trvp$1@dont-email.me>
<_sf6M.2705468$iU59.867750@fx14.iad> <u3cbr5$5cs1$1@dont-email.me>
<9mq6M.361324$rKDc.18371@fx34.iad> <u3dr6t$adhk$1@dont-email.me>
<XXz6M.596198$5CY7.189218@fx46.iad> <u3ens7$dmlj$1@dont-email.me>
<zsC6M.420575$ZnFc.164439@fx41.iad> <u3f0i6$i6bm$1@dont-email.me>
<o9L6M.2991409$vBI8.2430455@fx15.iad> <u3g9k5$n2jk$1@dont-email.me>
<6NV6M.362445$rKDc.280133@fx34.iad> <u3hlqk$vv0u$1@dont-email.me>
<1s47M.2759161$iU59.1670171@fx14.iad> <u3it56$147a9$2@dont-email.me>
<quh7M.3034951$vBI8.187696@fx15.iad> <u3k8it$1clv7$1@dont-email.me>
<LTh7M.1811499$MVg8.828957@fx12.iad> <u3kbsp$1d3i2$1@dont-email.me>
<yDi7M.488122$Sgyc.212125@fx40.iad> <u3kgkr$1dgrj$1@dont-email.me>
<1Kr7M.220169$T%ac.214451@fx01.iad>
<IfGdnWIvve0LyMP5nZ2dnZfqlJ9j4p2d@giganews.com>
<fMv7M.491956$Sgyc.243894@fx40.iad> <u3mco8$1qmer$2@dont-email.me>
<XrC7M.427054$ZhSc.122673@fx38.iad> <u3oru6$2auuq$1@dont-email.me>
From: Richard@Damon-Family.org (Richard Damon)
In-Reply-To: <u3oru6$2auuq$1@dont-email.me>
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 7bit
Lines: 131
Message-ID: <OyS7M.620275$5CY7.577133@fx46.iad>
X-Complaints-To: abuse@easynews.com
Organization: Forte - www.forteinc.com
X-Complaints-Info: Please be sure to forward a copy of ALL headers otherwise we will be unable to process your complaint properly.
Date: Sat, 13 May 2023 16:38:06 -0400
X-Received-Bytes: 6475
 by: Richard Damon - Sat, 13 May 2023 20:38 UTC

On 5/13/23 4:28 PM, olcott wrote:
> On 5/12/2023 9:18 PM, Richard Damon wrote:
>> On 5/12/23 5:57 PM, olcott wrote:
>>> On 5/12/2023 1:42 PM, Richard Damon wrote:
>>>> On 5/12/23 11:04 AM, olcott wrote:
>>>>> On 5/12/2023 9:06 AM, Richard Damon wrote:
>>>>>> On 5/12/23 12:51 AM, olcott wrote:
>>>>>>> On 5/11/2023 10:45 PM, Richard Damon wrote:
>>>>>>>> On 5/11/23 11:30 PM, olcott wrote:
>>>>>>>>> On 5/11/2023 9:54 PM, Richard Damon wrote:
>>>>>>>>>> On 5/11/23 10:34 PM, olcott wrote:
>>>>>>>>>>
>>>>>>>>>>>> FROM HIS PROOF!
>>>>>>>>>>>>
>>>>>>>>>>>> He first does a lot of work to establish a number of
>>>>>>>>>>>> properties.
>>>>>>>>>>> In other words you agree that Tarski did "prove" that the
>>>>>>>>>>> notion of
>>>>>>>>>>> Truth cannot be fully formalized on a fundamental basis
>>>>>>>>>>> directly related
>>>>>>>>>>> to the Liar Paradox?
>>>>>>>>>>>
>>>>>>>>>>
>>>>>>>>>> Only in the sense that since we KNOW the Liar's paradox can't
>>>>>>>>>> be true, and a "Definition of Truth" (not a "notion of Truth)
>>>>>>>>>> would lead to being able to prove that the Liar's paradox is
>>>>>>>>>> true,
>>>>>>>>>>
>>>>>>>>>
>>>>>>>>> That is ridiculous.
>>>>>>>>>
>>>>>>>>>
>>>>>>>>
>>>>>>>> Why? Do you think the Liar's Paradox should be provable to be True?
>>>>>>>>
>>>>>>>
>>>>>>> The Liar Paradox is not a truth bearer, END-OF-STORY !!!
>>>>>>
>>>>>> Right, so why do you fault Tarski for saying that?
>>>>>>
>>>>>> His proof shows that if a "Definition of Truth" existed, it
>>>>>> provides a way to prove the Liar's Paradox is True.
>>>>> That is a nutty idea.
>>>>> Any system that proves that a self-contradictory expression is true
>>>>> is a broken system.
>>>>
>>>> Right, and the proof shows that would be any system with a
>>>> "definition of Truth", so you AGREE with Tarski.
>>>>
>>>
>>> Not at all, Tarski's system is incorrect. All of analytical truth1 is a
>>> body of semantic tautologies that excludes the liar paradox.
>>>
>>> 1 It is commonly known that analytical truth includes all of math and
>>> all of logic. My new idea is that it also includes the model of the
>>> world.
>>>
>>>>>
>>>>> Analytic truth is derived from applying truth preserving operations to
>>>>> expressions of language that have been stipulated to be true.
>>>>> This cannot possibly derive non-truth bearers as true.
>>>>
>>>> Right, so you agre with Tarksi that there can not be a "Definition
>>>> of Truth".
>>>>
>>>
>>> Not at all.
>>>
>>>>>
>>>>> Prolog uses the exact same system that I just specified expressions
>>>>> that
>>>>> are stipulated to be true are Prolog facts with Prolog rules as a
>>>>> set of
>>>>> truth preserving operations.
>>>>
>>>> Prolog is limited in the logic it can do,
>>>>
>>>> But, so it seems are you.
>>>>
>>>>>
>>>>> Prolog is smart enough to reject the Liar Paradox.
>>>>>
>>>>> ?- LP = not(true(LP)).
>>>>> LP = not(true(LP)).
>>>>>
>>>>> ?- unify_with_occurs_check(LP, not(true(LP))).
>>>>> false.
>>>>>
>>>>> The above test shows that LP is infinitely recursive never
>>>>> resolving to a truth value.
>>>>>
>>>>>
>>>>
>>>> So?
>>>
>>> Tarski was too stupid (on this one issue) to understand that the Liar
>>> Paradox is excluded from the body of truth.
>>>
>>
>> Why do you say that? WHere does he say what you say he is saying?
>>
>> Please point out the pont where he is ACCEPTING the Liar's paradox.
>>
>> The point where the Liar coms up, he uses that fact to point out that
>> the intial assumption MUST be incorrect, as it lead to proving a
>> non-true statement.
>>
>> I think your problem is that you just don't understand the proof you
>> are reading and reading into it the errors that you yourself make.
>
> Anyone that uses the Liar Paradox as any basis for showing the
> properties of truth has committed a category error1, the Liar Paradox is
> excluded from the category of truth.
>
> 1 Flibble's key insight
>
>

So, you jut don't understand the concept of a proof by contradiction?

I guess your understanding of logic is too primative.

You yourself said that any system that accepts the Liar's Paradox as a
truth bearer must be broken.

Since what Tarski shows is that any system with a "Definition of Truth"
will accept the Liar's Paradox as a True Statement, you must agree that
he is correct.

That, or you are admitting that you speak with forked tounge and nothin
gyou say actually makes sense.

Re: Gödel's proof relies on self-contradictory expressions of language

<u3osnl$2b2j9$1@dont-email.me>

  copy mid

https://www.rocksolidbbs.com/computers/article-flat.php?id=11166&group=comp.ai.philosophy#11166

  copy link   Newsgroups: comp.theory sci.logic comp.ai.philosophy
Path: i2pn2.org!i2pn.org!eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail
From: news.x.richarddamon@xoxy.net (Richard Damon)
Newsgroups: comp.theory,sci.logic,comp.ai.philosophy
Subject: Re:_Gödel's_proof_relies_on_self-contradictory_e
xpressions_of_language
Date: Sat, 13 May 2023 16:42:29 -0400
Organization: A noiseless patient Spider
Lines: 10
Message-ID: <u3osnl$2b2j9$1@dont-email.me>
References: <u38nv6$3f467$1@dont-email.me> <u3b5tt$3trvp$1@dont-email.me>
<_sf6M.2705468$iU59.867750@fx14.iad> <u3cbr5$5cs1$1@dont-email.me>
<9mq6M.361324$rKDc.18371@fx34.iad> <u3dr6t$adhk$1@dont-email.me>
<XXz6M.596198$5CY7.189218@fx46.iad> <u3ens7$dmlj$1@dont-email.me>
<zsC6M.420575$ZnFc.164439@fx41.iad> <u3f0i6$i6bm$1@dont-email.me>
<o9L6M.2991409$vBI8.2430455@fx15.iad> <u3g9k5$n2jk$1@dont-email.me>
<6NV6M.362445$rKDc.280133@fx34.iad> <u3hlqk$vv0u$1@dont-email.me>
<1s47M.2759161$iU59.1670171@fx14.iad> <u3it56$147a9$2@dont-email.me>
<quh7M.3034951$vBI8.187696@fx15.iad> <u3k8it$1clv7$1@dont-email.me>
<LTh7M.1811499$MVg8.828957@fx12.iad> <u3kbsp$1d3i2$1@dont-email.me>
<yDi7M.488122$Sgyc.212125@fx40.iad> <u3kgkr$1dgrj$1@dont-email.me>
<1Kr7M.220169$T%ac.214451@fx01.iad>
<IfGdnWIvve0LyMP5nZ2dnZfqlJ9j4p2d@giganews.com>
<fMv7M.491956$Sgyc.243894@fx40.iad> <u3mco8$1qmer$2@dont-email.me>
<XrC7M.427054$ZhSc.122673@fx38.iad> <u3oru6$2auuq$1@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 7bit
Injection-Date: Sat, 13 May 2023 20:42:29 -0000 (UTC)
Injection-Info: dont-email.me; posting-host="5578e0b07929fb42ef2bbab93fc967a2";
logging-data="2460265"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1/24p3G0CjdLFaw7g96p/ht7kNSnQEWO4E="
User-Agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10.15; rv:102.0)
Gecko/20100101 Thunderbird/102.11.0
Cancel-Lock: sha1:7qUHe+ASBE7zJojS5HWCvUof+fc=
In-Reply-To: <u3oru6$2auuq$1@dont-email.me>
Content-Language: en-US
 by: Richard Damon - Sat, 13 May 2023 20:42 UTC

On 5/13/23 4:28 PM, olcott wrote:

> Anyone that uses the Liar Paradox as any basis for showing the
> properties of truth has committed a category error1, the Liar Paradox is
> excluded from the category of truth.

So, since YOUR arguement uses the Liar's Paradox as a basis of
determining true, YOU have committed a category error?

Pages:12
server_pubkey.txt

rocksolid light 0.9.81
clearnet tor