Rocksolid Light

Welcome to novaBBS (click a section below)

mail  files  register  newsreader  groups  login

Message-ID:  

An elephant is a mouse with an operating system.


computers / comp.ai.philosophy / Tarski Undefinability Theorem is refuted

SubjectAuthor
* Tarski Undefinability Theorem is refutedolcott
+* Re: Tarski Undefinability Theorem is refutedRichard Damon
|`* Re: Tarski Undefinability Theorem is refutedolcott
| `* Re: Tarski Undefinability Theorem is refutedRichard Damon
|  `* Re: Tarski Undefinability Theorem is refutedolcott
|   `* Re: Tarski Undefinability Theorem is refutedRichard Damon
|    `* Re: Tarski Undefinability Theorem is refutedolcott
|     `* Re: Tarski Undefinability Theorem is refutedRichard Damon
|      `* Re: Tarski Undefinability Theorem is refutedolcott
|       `* Re: Tarski Undefinability Theorem is refutedRichard Damon
|        `* Re: Tarski Undefinability Theorem is refutedolcott
|         `* Re: Tarski Undefinability Theorem is refutedRichard Damon
|          `* Re: Tarski Undefinability Theorem is refutedolcott
|           `* Re: Tarski Undefinability Theorem is refutedRichard Damon
|            `* Re: Tarski Undefinability Theorem is refutedolcott
|             `* Re: Tarski Undefinability Theorem is refutedRichard Damon
|              `* Re: Tarski Undefinability Theorem is refutedolcott
|               `* Re: Tarski Undefinability Theorem is refutedRichard Damon
|                `* Re: Tarski Undefinability Theorem is refutedolcott
|                 `* Re: Tarski Undefinability Theorem is refutedRichard Damon
|                  `* Re: Tarski Undefinability Theorem is refutedolcott
|                   `* Re: Tarski Undefinability Theorem is refutedRichard Damon
|                    `* Re: Tarski Undefinability Theorem is refutedolcott
|                     `* Re: Tarski Undefinability Theorem is refutedRichard Damon
|                      +* Re: Tarski Undefinability Theorem is refutedolcott
|                      |`* Re: Tarski Undefinability Theorem is refutedRichard Damon
|                      | `* Re: Tarski Undefinability Theorem is refutedolcott
|                      |  `* Re: Tarski Undefinability Theorem is refutedRichard Damon
|                      |   `* Re: Tarski Undefinability Theorem is refutedolcott
|                      |    `* Re: Tarski Undefinability Theorem is refutedRichard Damon
|                      |     `* Re: Tarski Undefinability Theorem is refutedolcott
|                      |      `* Re: Tarski Undefinability Theorem is refutedRichard Damon
|                      |       `* Re: Tarski Undefinability Theorem is refutedolcott
|                      |        `* Re: Tarski Undefinability Theorem is refutedRichard Damon
|                      |         `* Re: Tarski Undefinability Theorem is refutedolcott
|                      |          +* Re: Tarski Undefinability Theorem is refutedDon Stockbauer
|                      |          |`- Re: Tarski Undefinability Theorem is refutedolcott
|                      |          `* Re: Tarski Undefinability Theorem is refutedRichard Damon
|                      |           `* Re: Tarski Undefinability Theorem is refutedolcott
|                      |            `* Re: Tarski Undefinability Theorem is refutedRichard Damon
|                      |             `* Re: Tarski Undefinability Theorem is refuted [also Golcott
|                      |              `* Re: Tarski Undefinability Theorem is refuted [also GRichard Damon
|                      |               +* Re: Tarski Undefinability Theorem is refuted [also Golcott
|                      |               |`* Re: Tarski Undefinability Theorem is refuted [also GRichard Damon
|                      |               | `* Re: Tarski Undefinability Theorem is refuted [also Golcott
|                      |               |  `* Re: Tarski Undefinability Theorem is refuted [also GRichard Damon
|                      |               |   +* Re: Tarski Undefinability Theorem is refuted [also Golcott
|                      |               |   |`* Re: Tarski Undefinability Theorem is refuted [also GRichard Damon
|                      |               |   | +* Re: Tarski Undefinability Theorem is refuted [also Golcott
|                      |               |   | |`* Re: Tarski Undefinability Theorem is refuted [also GRichard Damon
|                      |               |   | | `* Re: Tarski Undefinability Theorem is refuted [also Golcott
|                      |               |   | |  `* Re: Tarski Undefinability Theorem is refuted [also GRichard Damon
|                      |               |   | |   `* Re: Tarski Undefinability Theorem is refuted [also Golcott
|                      |               |   | |    `* Re: Tarski Undefinability Theorem is refuted [also GRichard Damon
|                      |               |   | |     `* Re: Tarski Undefinability Theorem is refuted [also Golcott
|                      |               |   | |      `* Re: Tarski Undefinability Theorem is refuted [also GRichard Damon
|                      |               |   | |       `* Re: Tarski Undefinability Theorem is refuted [also Golcott
|                      |               |   | |        `* Re: Tarski Undefinability Theorem is refuted [also GRichard Damon
|                      |               |   | |         +* Re: Tarski Undefinability Theorem is refuted [also Golcott
|                      |               |   | |         |`* Re: Tarski Undefinability Theorem is refuted [also GRichard Damon
|                      |               |   | |         | +* Re: Tarski Undefinability Theorem is refuted [also Golcott
|                      |               |   | |         | |`* Re: Tarski Undefinability Theorem is refuted [also GRichard Damon
|                      |               |   | |         | | `* Re: Tarski Undefinability Theorem is refuted [also Golcott
|                      |               |   | |         | |  `- Re: Tarski Undefinability Theorem is refuted [also GRichard Damon
|                      |               |   | |         | `* Re: Tarski Undefinability Theorem is refuted [also Golcott
|                      |               |   | |         |  `- Re: Tarski Undefinability Theorem is refuted [also GRichard Damon
|                      |               |   | |         `* Re: Tarski Undefinability Theorem is refuted [also Golcott
|                      |               |   | |          `* Re: Tarski Undefinability Theorem is refuted [also GRichard Damon
|                      |               |   | |           `* Re: Tarski Undefinability Theorem is refuted [also Golcott
|                      |               |   | |            `- Re: Tarski Undefinability Theorem is refuted [also GRichard Damon
|                      |               |   | `- Re: Tarski Undefinability Theorem is refuted [also GDon Stockbauer
|                      |               |   `* Re: Tarski Undefinability Theorem is refuted [also Golcott
|                      |               |    `- Re: Tarski Undefinability Theorem is refuted [also GRichard Damon
|                      |               `* Re: Tarski Undefinability Theorem is refuted [also Golcott
|                      |                `- Re: Tarski Undefinability Theorem is refuted [also GRichard Damon
|                      +* Re: Tarski Undefinability Theorem is refutedolcott
|                      |`* Re: Tarski Undefinability Theorem is refutedRichard Damon
|                      | `* Re: Tarski Undefinability Theorem is refutedolcott
|                      |  `* Re: Tarski Undefinability Theorem is refutedRichard Damon
|                      |   +* Re: Tarski Undefinability Theorem is refutedolcott
|                      |   |`* Re: Tarski Undefinability Theorem is refutedRichard Damon
|                      |   | `* Re: Tarski Undefinability Theorem is refutedolcott
|                      |   |  `* Re: Tarski Undefinability Theorem is refutedRichard Damon
|                      |   |   `- Re: Tarski Undefinability Theorem is refutedolcott
|                      |   +* Re: Tarski Undefinability Theorem is refutedolcott
|                      |   |`* Re: Tarski Undefinability Theorem is refutedRichard Damon
|                      |   | `* Re: Tarski Undefinability Theorem is refutedolcott
|                      |   |  `* Re: Tarski Undefinability Theorem is refutedRichard Damon
|                      |   |   `* Re: Tarski Undefinability Theorem is refutedolcott
|                      |   |    `* Re: Tarski Undefinability Theorem is refutedRichard Damon
|                      |   |     `- Re: Tarski Undefinability Theorem is refutedolcott
|                      |   `* Re: Tarski Undefinability Theorem is refutedolcott
|                      |    `* Re: Tarski Undefinability Theorem is refutedRichard Damon
|                      |     `* Re: Tarski Undefinability Theorem is refutedolcott
|                      |      `* Re: Tarski Undefinability Theorem is refutedRichard Damon
|                      |       `* Re: Tarski Undefinability Theorem is refutedolcott
|                      |        `* Re: Tarski Undefinability Theorem is refutedRichard Damon
|                      |         `* Re: Tarski Undefinability Theorem is refutedolcott
|                      |          `* Re: Tarski Undefinability Theorem is refutedRichard Damon
|                      |           `* Re: Tarski Undefinability Theorem is refuted [also Golcott
|                      |            +* Re: Tarski Undefinability Theorem is refuted [also GRichard Damon
|                      |            `- Re: Tarski Undefinability Theorem is refuted [also GDon Stockbauer
|                      `* Re: Tarski Undefinability Theorem is refutedolcott
+- Re: Tarski Undefinability Theorem is refutedolcott
`* Re: Tarski Undefinability Theorem is refutedolcott

Pages:12345
Re: Tarski Undefinability Theorem is refuted

<toq5r8$13kvn$1@dont-email.me>

  copy mid

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

  copy link   Newsgroups: comp.theory comp.ai.philosophy sci.logic
Path: i2pn2.org!i2pn.org!eternal-september.org!reader01.eternal-september.org!.POSTED!not-for-mail
From: polco...@gmail.com (olcott)
Newsgroups: comp.theory,comp.ai.philosophy,sci.logic
Subject: Re: Tarski Undefinability Theorem is refuted
Date: Sat, 31 Dec 2022 14:25:11 -0600
Organization: A noiseless patient Spider
Lines: 73
Message-ID: <toq5r8$13kvn$1@dont-email.me>
References: <tokimd$c7q9$1@dont-email.me> <Y4lrL.204366$8_id.12194@fx09.iad>
<tokocm$ct3m$1@dont-email.me> <gymrL.58668$SdR7.1356@fx04.iad>
<toktee$ct3m$3@dont-email.me> <p6nrL.24263$5S78.3335@fx48.iad>
<ton062$mkig$1@dont-email.me> <c8ErL.153012$gGD7.51143@fx11.iad>
<ton3n7$msft$2@dont-email.me> <9DFrL.108564$Tcw8.7605@fx10.iad>
<tonqqm$plfv$1@dont-email.me> <mZLrL.430121$GNG9.49737@fx18.iad>
<toocgp$u29q$1@dont-email.me> <LqPrL.59543$SdR7.255@fx04.iad>
<topgct$11eou$2@dont-email.me> <2DYrL.31899$4jN7.6964@fx02.iad>
<topnro$12an3$1@dont-email.me> <7EZrL.24698$b7Kc.23514@fx39.iad>
<topqd9$12gbh$1@dont-email.me> <Q%_rL.14622$ZhSc.13601@fx38.iad>
<topvb5$12up5$1@dont-email.me> <rL%rL.14722$ZhSc.3153@fx38.iad>
<toq2ra$13eo3$1@dont-email.me> <yH0sL.25579$Lfzc.19594@fx36.iad>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Sat, 31 Dec 2022 20:25:12 -0000 (UTC)
Injection-Info: reader01.eternal-september.org; posting-host="3968557e93923c9e5f004f92178a57c4";
logging-data="1168375"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1/S+VKA57xmyT0eLju4EGXb"
User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:102.0) Gecko/20100101
Thunderbird/102.6.1
Cancel-Lock: sha1:zCgTYKGmTyRtNYWpA/DgWlyvJHw=
In-Reply-To: <yH0sL.25579$Lfzc.19594@fx36.iad>
Content-Language: en-US
 by: olcott - Sat, 31 Dec 2022 20:25 UTC

On 12/31/2022 2:11 PM, Richard Damon wrote:
> On 12/31/22 2:34 PM, olcott wrote:
>> On 12/31/2022 1:07 PM, Richard Damon wrote:
>>> On 12/31/22 1:34 PM, olcott wrote:
>>>> On 12/31/2022 12:16 PM, Richard Damon wrote:
>>>>> On 12/31/22 12:10 PM, olcott wrote:
>>>>>
>>>>>> This sentence is not true.
>>>>>> is not true because it is self-contradictory.
>>>>>
>>>>> Right, and thus there can not be a Definition of Truth in the
>>>>> system because if there was, you could show that statement True.
>>>>
>>>> 這句話不是真的: "This sentence is not true."
>>>> The Chinese says "This sentence is not true:" referring to the English.
>>>>
>>>> The Chinese sentence is true because the English sentence is
>>>> self-contradictory. This is an exact isomorphism to:
>>>>
>>>>    "sentence x which is undecidable in the original theory [my English]
>>>>     becomes a decidable sentence in the enriched theory [my Chinese]."
>>>>
>>>
>>> Which is a non-sequitor, showing you don't understand what you are
>>> talking about.
>>>
>>> You are just proving your Stupidity.
>>>
>>> I don't think you even actually understand any of the basics of logic.
>>>
>>> You can parrot words, but you show an utter lack of knowledge about
>>> how any of it works.
>>
>> Try and paraphrase 100% perfectly exactly what you think that Tarski is
>> saying. Any idiot (even a bot) can claim that someone is wrong.
>
> **Like you are doing**
>
>>
>> It takes actual understanding to point out the exact error and the
>> reason that it is an error.
>>
>>
>
> Why do we need to paraphrase?
>
> He says that a "Definition" of Truth, by which he means a way to
> determine if a given arbitrary sentence expressed in the Theory is True
> or False (or not a Truth Bearer) because, if such a definition existed,
> then from that definition you could prove in the defined Meta-Theory
> that a Statement like the Liar's Paradox was actually True.

https://liarparadox.org/Tarski_275_276.pdf
That is not what he is saying, try again.

>
> Thus, since we know that can't be, there must not be an ability to
> define in a system of logic, a "Definition of Truth" that allows you to
> determine (i.e. Proof) every True Statement, Disprove every false
> statement, and determine that every non-truthbearer was a non-truthbearer.
>
>
> What else do you think he is saying?

"sentence x which is undecidable in the original theory
becomes a decidable sentence in the enriched theory"

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

Re: Tarski Undefinability Theorem is refuted

<9C1sL.246623$9sn9.233359@fx17.iad>

  copy mid

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

  copy link   Newsgroups: comp.theory comp.ai.philosophy sci.logic
Path: i2pn2.org!i2pn.org!usenet.blueworldhosting.com!feed1.usenet.blueworldhosting.com!peer03.iad!feed-me.highwinds-media.com!news.highwinds-media.com!fx17.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.6.1
Subject: Re: Tarski Undefinability Theorem is refuted
Content-Language: en-US
Newsgroups: comp.theory,comp.ai.philosophy,sci.logic
References: <tokimd$c7q9$1@dont-email.me> <Y4lrL.204366$8_id.12194@fx09.iad>
<tokocm$ct3m$1@dont-email.me> <gymrL.58668$SdR7.1356@fx04.iad>
<toktee$ct3m$3@dont-email.me> <p6nrL.24263$5S78.3335@fx48.iad>
<ton062$mkig$1@dont-email.me> <c8ErL.153012$gGD7.51143@fx11.iad>
<ton3n7$msft$2@dont-email.me> <9DFrL.108564$Tcw8.7605@fx10.iad>
<tonqqm$plfv$1@dont-email.me> <mZLrL.430121$GNG9.49737@fx18.iad>
<toocgp$u29q$1@dont-email.me> <LqPrL.59543$SdR7.255@fx04.iad>
<topgct$11eou$2@dont-email.me> <2DYrL.31899$4jN7.6964@fx02.iad>
<topnro$12an3$1@dont-email.me> <7EZrL.24698$b7Kc.23514@fx39.iad>
<topqd9$12gbh$1@dont-email.me> <Q%_rL.14622$ZhSc.13601@fx38.iad>
<topvb5$12up5$1@dont-email.me> <rL%rL.14722$ZhSc.3153@fx38.iad>
<toq2ra$13eo3$1@dont-email.me> <yH0sL.25579$Lfzc.19594@fx36.iad>
<toq5r8$13kvn$1@dont-email.me>
From: Rich...@Damon-Family.org (Richard Damon)
In-Reply-To: <toq5r8$13kvn$1@dont-email.me>
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Lines: 109
Message-ID: <9C1sL.246623$9sn9.233359@fx17.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, 31 Dec 2022 16:13:39 -0500
X-Received-Bytes: 5918
 by: Richard Damon - Sat, 31 Dec 2022 21:13 UTC

On 12/31/22 3:25 PM, olcott wrote:
> On 12/31/2022 2:11 PM, Richard Damon wrote:
>> On 12/31/22 2:34 PM, olcott wrote:
>>> On 12/31/2022 1:07 PM, Richard Damon wrote:
>>>> On 12/31/22 1:34 PM, olcott wrote:
>>>>> On 12/31/2022 12:16 PM, Richard Damon wrote:
>>>>>> On 12/31/22 12:10 PM, olcott wrote:
>>>>>>
>>>>>>> This sentence is not true.
>>>>>>> is not true because it is self-contradictory.
>>>>>>
>>>>>> Right, and thus there can not be a Definition of Truth in the
>>>>>> system because if there was, you could show that statement True.
>>>>>
>>>>> 這句話不是真的: "This sentence is not true."
>>>>> The Chinese says "This sentence is not true:" referring to the
>>>>> English.
>>>>>
>>>>> The Chinese sentence is true because the English sentence is
>>>>> self-contradictory. This is an exact isomorphism to:
>>>>>
>>>>>    "sentence x which is undecidable in the original theory [my
>>>>> English]
>>>>>     becomes a decidable sentence in the enriched theory [my Chinese]."
>>>>>
>>>>
>>>> Which is a non-sequitor, showing you don't understand what you are
>>>> talking about.
>>>>
>>>> You are just proving your Stupidity.
>>>>
>>>> I don't think you even actually understand any of the basics of logic.
>>>>
>>>> You can parrot words, but you show an utter lack of knowledge about
>>>> how any of it works.
>>>
>>> Try and paraphrase 100% perfectly exactly what you think that Tarski is
>>> saying. Any idiot (even a bot) can claim that someone is wrong.
>>
>> **Like you are doing**
>>
>>>
>>> It takes actual understanding to point out the exact error and the
>>> reason that it is an error.
>>>
>>>
>>
>> Why do we need to paraphrase?
>>
>> He says that a "Definition" of Truth, by which he means a way to
>> determine if a given arbitrary sentence expressed in the Theory is
>> True or False (or not a Truth Bearer) because, if such a definition
>> existed, then from that definition you could prove in the defined
>> Meta-Theory that a Statement like the Liar's Paradox was actually True.
>
>
> https://liarparadox.org/Tarski_275_276.pdf
> That is not what he is saying, try again.

Like you just said, even an idiot can just claim something is wrong.

Note, since you aren't even showing the full chapter (which likely would
be a copyright violation) its hard to get the full context of his
statements, but thesse pages are

>
>>
>> Thus, since we know that can't be, there must not be an ability to
>> define in a system of logic, a "Definition of Truth" that allows you
>> to determine (i.e. Proof) every True Statement, Disprove every false
>> statement, and determine that every non-truthbearer was a
>> non-truthbearer.
>>
>>
>> What else do you think he is saying?
>
>   "sentence x which is undecidable in the original theory
>    becomes a decidable sentence in the enriched theory"
>
>

ACCORDING TO THESIS A, this isn't neccesarily true if Thesis A isn't
True. In fact, I suspect this whole section is building up to showing
this leads to a contradiction, and thus THESIS A isn't True.

Remeber, at the end he says:

I should like to draw attention here to an analogous result. For every
deductive science in "Which arithmetic is contained it is possible to
specify arithmetical notions which, so to speak, belong intuitively to
this science, but ,vhich cannot be defined on the basis of this science.
'Vith the help of methods which are, completely analogous to those used
in the copstruction of the definition of truth, it is nevertheless
possible to show that these concepts can be so defined provided the
science is enriched by the introduction of variables of higher order.

Which points out that IN THE THEORY, there are things which can not be
defined, but need to be expressed in a higher order Theory (the Meta Theory)

By extension, there will be things in the Meta-Theory which can not be
defined, but need to be expressed in an even HIGHER order Theory (a
Meta-Meta-Theory) and so on.

Thus in any Theory, or Meta^n Theory, there will ALWAYS be things that
can not be defined.

You don't seem to understand how proof by contradiction works, because
you mind is too simple.

Re: Tarski Undefinability Theorem is refuted

<tosal9$1emtp$1@dont-email.me>

  copy mid

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

  copy link   Newsgroups: comp.theory comp.ai.philosophy sci.logic
Path: i2pn2.org!i2pn.org!eternal-september.org!reader01.eternal-september.org!.POSTED!not-for-mail
From: polco...@gmail.com (olcott)
Newsgroups: comp.theory,comp.ai.philosophy,sci.logic
Subject: Re: Tarski Undefinability Theorem is refuted
Date: Sun, 1 Jan 2023 09:59:36 -0600
Organization: A noiseless patient Spider
Lines: 114
Message-ID: <tosal9$1emtp$1@dont-email.me>
References: <tokimd$c7q9$1@dont-email.me> <Y4lrL.204366$8_id.12194@fx09.iad>
<tokocm$ct3m$1@dont-email.me> <gymrL.58668$SdR7.1356@fx04.iad>
<toktee$ct3m$3@dont-email.me> <p6nrL.24263$5S78.3335@fx48.iad>
<ton062$mkig$1@dont-email.me> <c8ErL.153012$gGD7.51143@fx11.iad>
<ton3n7$msft$2@dont-email.me> <9DFrL.108564$Tcw8.7605@fx10.iad>
<tonqqm$plfv$1@dont-email.me> <mZLrL.430121$GNG9.49737@fx18.iad>
<toocgp$u29q$1@dont-email.me> <LqPrL.59543$SdR7.255@fx04.iad>
<topgct$11eou$2@dont-email.me> <2DYrL.31899$4jN7.6964@fx02.iad>
<topnro$12an3$1@dont-email.me> <7EZrL.24698$b7Kc.23514@fx39.iad>
<topqd9$12gbh$1@dont-email.me> <Q%_rL.14622$ZhSc.13601@fx38.iad>
<topvb5$12up5$1@dont-email.me> <rL%rL.14722$ZhSc.3153@fx38.iad>
<toq2ra$13eo3$1@dont-email.me> <yH0sL.25579$Lfzc.19594@fx36.iad>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Sun, 1 Jan 2023 15:59:37 -0000 (UTC)
Injection-Info: reader01.eternal-september.org; posting-host="ec74fc7ff5b29acdb9caf17777acae89";
logging-data="1530809"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1+cv2JBdh1pyzE0mOwo9GIQ"
User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:102.0) Gecko/20100101
Thunderbird/102.6.1
Cancel-Lock: sha1:5gv6avk7Cy7BVCbUD5zbjF1p9/g=
Content-Language: en-US
In-Reply-To: <yH0sL.25579$Lfzc.19594@fx36.iad>
 by: olcott - Sun, 1 Jan 2023 15:59 UTC

On 12/31/2022 2:11 PM, Richard Damon wrote:
> On 12/31/22 2:34 PM, olcott wrote:
>> On 12/31/2022 1:07 PM, Richard Damon wrote:
>>> On 12/31/22 1:34 PM, olcott wrote:
>>>> On 12/31/2022 12:16 PM, Richard Damon wrote:
>>>>> On 12/31/22 12:10 PM, olcott wrote:
>>>>>
>>>>>> This sentence is not true.
>>>>>> is not true because it is self-contradictory.
>>>>>
>>>>> Right, and thus there can not be a Definition of Truth in the
>>>>> system because if there was, you could show that statement True.
>>>>
>>>> 這句話不是真的: "This sentence is not true."
>>>> The Chinese says "This sentence is not true:" referring to the English.
>>>>
>>>> The Chinese sentence is true because the English sentence is
>>>> self-contradictory. This is an exact isomorphism to:
>>>>
>>>>    "sentence x which is undecidable in the original theory [my English]
>>>>     becomes a decidable sentence in the enriched theory [my Chinese]."
>>>>
>>>
>>> Which is a non-sequitor, showing you don't understand what you are
>>> talking about.
>>>
>>> You are just proving your Stupidity.
>>>
>>> I don't think you even actually understand any of the basics of logic.
>>>
>>> You can parrot words, but you show an utter lack of knowledge about
>>> how any of it works.
>>
>> Try and paraphrase 100% perfectly exactly what you think that Tarski is
>> saying. Any idiot (even a bot) can claim that someone is wrong.
>
> **Like you are doing**
>
>>
>> It takes actual understanding to point out the exact error and the
>> reason that it is an error.
>>
>>
>
> Why do we need to paraphrase?
>
> He says that a "Definition" of Truth, by which he means a way to
> determine if a given arbitrary sentence expressed in the Theory is True
> or False (or not a Truth Bearer) because, if such a definition existed,
> then from that definition you could prove in the defined Meta-Theory
> that a Statement like the Liar's Paradox was actually True.
>

No that is incorrect. Tarski never indicated that he understood that
expressions of formal language are not necessarily truth bearers.

This sentence is true:
{The following sentence is not true: "This sentence is not true."}

> Thus, since we know that can't be,

Try and think of any expression of language that is true entirely on the
basis of its meaning that does not have truthmaker connections to these
semantic meanings.

If no such counter example exists in the universe then that proves that
I am correct about the requirement of semantic connections to truth
makers.

Self-contradictory expressions of language have no truthmaker semantic
connections.

This also applies to expressions of language that have vacuous truth
objects: "This sentence is true"

True about what?
True about being true.
True about being true about what?
True about being true about being true.

Ah I see an infinitely recursive structure that never is never resolved
to a truth value, thus not a truth bearer.

> there must not be an ability to
> define in a system of logic, a "Definition of Truth" that allows you to
> determine (i.e. Proof) every True Statement, Disprove every false
> statement, and determine that every non-truthbearer was a non-truthbearer.
>

The possible requirement of an infinite proof requires that some
expressions of language can only have an unknown Boolean value.
We can't even tell that they definitely require an infinite proof.

The Goldbach Conjecture has a currently unknown Boolean value.
https://en.wikipedia.org/wiki/Goldbach%27s_conjecture
It does seem to be a truth bearer.

Analytic Knowledge is defined as expressions of language that have a
finite set of connections to their truth maker semantic meanings.

Analytic Truth is defined as expressions of language that have a finite
or infinite set of connections to their truth maker semantic meanings.

Non Truth Bearers are defined as expressions of language having no
connections to any truth maker semantic meanings.

>
> What else do you think he is saying?

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

Re: Tarski Undefinability Theorem is refuted

<o3ksL.30783$Olad.13377@fx35.iad>

  copy mid

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

  copy link   Newsgroups: comp.theory comp.ai.philosophy sci.logic
Path: i2pn2.org!i2pn.org!usenet.blueworldhosting.com!feed1.usenet.blueworldhosting.com!peer02.iad!feed-me.highwinds-media.com!news.highwinds-media.com!fx35.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.6.1
Subject: Re: Tarski Undefinability Theorem is refuted
Newsgroups: comp.theory,comp.ai.philosophy,sci.logic
References: <tokimd$c7q9$1@dont-email.me> <Y4lrL.204366$8_id.12194@fx09.iad>
<tokocm$ct3m$1@dont-email.me> <gymrL.58668$SdR7.1356@fx04.iad>
<toktee$ct3m$3@dont-email.me> <p6nrL.24263$5S78.3335@fx48.iad>
<ton062$mkig$1@dont-email.me> <c8ErL.153012$gGD7.51143@fx11.iad>
<ton3n7$msft$2@dont-email.me> <9DFrL.108564$Tcw8.7605@fx10.iad>
<tonqqm$plfv$1@dont-email.me> <mZLrL.430121$GNG9.49737@fx18.iad>
<toocgp$u29q$1@dont-email.me> <LqPrL.59543$SdR7.255@fx04.iad>
<topgct$11eou$2@dont-email.me> <2DYrL.31899$4jN7.6964@fx02.iad>
<topnro$12an3$1@dont-email.me> <7EZrL.24698$b7Kc.23514@fx39.iad>
<topqd9$12gbh$1@dont-email.me> <Q%_rL.14622$ZhSc.13601@fx38.iad>
<topvb5$12up5$1@dont-email.me> <rL%rL.14722$ZhSc.3153@fx38.iad>
<toq2ra$13eo3$1@dont-email.me> <yH0sL.25579$Lfzc.19594@fx36.iad>
<tosal9$1emtp$1@dont-email.me>
From: Rich...@Damon-Family.org (Richard Damon)
Content-Language: en-US
In-Reply-To: <tosal9$1emtp$1@dont-email.me>
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Lines: 150
Message-ID: <o3ksL.30783$Olad.13377@fx35.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: Sun, 1 Jan 2023 13:13:38 -0500
X-Received-Bytes: 6981
 by: Richard Damon - Sun, 1 Jan 2023 18:13 UTC

On 1/1/23 10:59 AM, olcott wrote:
> On 12/31/2022 2:11 PM, Richard Damon wrote:
>> On 12/31/22 2:34 PM, olcott wrote:
>>> On 12/31/2022 1:07 PM, Richard Damon wrote:
>>>> On 12/31/22 1:34 PM, olcott wrote:
>>>>> On 12/31/2022 12:16 PM, Richard Damon wrote:
>>>>>> On 12/31/22 12:10 PM, olcott wrote:
>>>>>>
>>>>>>> This sentence is not true.
>>>>>>> is not true because it is self-contradictory.
>>>>>>
>>>>>> Right, and thus there can not be a Definition of Truth in the
>>>>>> system because if there was, you could show that statement True.
>>>>>
>>>>> 這句話不是真的: "This sentence is not true."
>>>>> The Chinese says "This sentence is not true:" referring to the
>>>>> English.
>>>>>
>>>>> The Chinese sentence is true because the English sentence is
>>>>> self-contradictory. This is an exact isomorphism to:
>>>>>
>>>>>    "sentence x which is undecidable in the original theory [my
>>>>> English]
>>>>>     becomes a decidable sentence in the enriched theory [my Chinese]."
>>>>>
>>>>
>>>> Which is a non-sequitor, showing you don't understand what you are
>>>> talking about.
>>>>
>>>> You are just proving your Stupidity.
>>>>
>>>> I don't think you even actually understand any of the basics of logic.
>>>>
>>>> You can parrot words, but you show an utter lack of knowledge about
>>>> how any of it works.
>>>
>>> Try and paraphrase 100% perfectly exactly what you think that Tarski is
>>> saying. Any idiot (even a bot) can claim that someone is wrong.
>>
>> **Like you are doing**
>>
>>>
>>> It takes actual understanding to point out the exact error and the
>>> reason that it is an error.
>>>
>>>
>>
>> Why do we need to paraphrase?
>>
>> He says that a "Definition" of Truth, by which he means a way to
>> determine if a given arbitrary sentence expressed in the Theory is
>> True or False (or not a Truth Bearer) because, if such a definition
>> existed, then from that definition you could prove in the defined
>> Meta-Theory that a Statement like the Liar's Paradox was actually True.
>>
>
> No that is incorrect. Tarski never indicated that he understood that
> expressions of formal language are not necessarily truth bearers.

Can yo PROVE that tement, have you read EVERYTHING he has written.

He actually seems to understand this, because he uses the fact that
"proving" the Liar's Paradox, based on an assumed Thesis, shows the
assumed Thesis must be false.

>
> This sentence is true:
> {The following sentence is not true: "This sentence is not true."}
>
>
>> Thus, since we know that can't be,
>
> Try and think of any expression of language that is true entirely on the
> basis of its meaning that does not have truthmaker connections to these
> semantic meanings.

No one is arguing that.

>
> If no such counter example exists in the universe then that proves that
> I am correct about the requirement of semantic connections to truth
> makers.

Right, but that doesn't make it PROVABLE by the definition of Provable.

>
> Self-contradictory expressions of language have no truthmaker semantic
> connections.
>
> This also applies to expressions of language that have vacuous truth
> objects: "This sentence is true"
>
> True about what?
> True about being true.
> True about being true about what?
> True about being true about being true.
>
> Ah I see an infinitely recursive structure that never is never resolved
> to a truth value, thus not a truth bearer.

>
>> there must not be an ability to define in a system of logic, a
>> "Definition of Truth" that allows you to determine (i.e. Proof) every
>> True Statement, Disprove every false statement, and determine that
>> every non-truthbearer was a non-truthbearer.
>>
>
> The possible requirement of an infinite proof requires that some
> expressions of language can only have an unknown Boolean value.
> We can't even tell that they definitely require an infinite proof.

Right, its value is unknown in that Thoery, and thus unprovable in that
theory. A Meta-Theory may be able to show that it actually IS true in
that theory, and thus we have in the Theory a statment that actually is
True (but not KNOWN to be true in the Theory) that is unprovable.

>
> The Goldbach Conjecture has a currently unknown Boolean value.
> https://en.wikipedia.org/wiki/Goldbach%27s_conjecture
> It does seem to be a truth bearer.
>

it MUST be a Truth Bearer, as either a number exists that breaks the
rule, or no such number exist.

> Analytic Knowledge is defined as expressions of language that have a
> finite set of connections to their truth maker semantic meanings.
>
> Analytic Truth is defined as expressions of language that have a finite
> or infinite set of connections to their truth maker semantic meanings.

Right, so some Truths will be not knownable, and thus not Provable.

>
> Non Truth Bearers are defined as expressions of language having no
> connections to any truth maker semantic meanings.
>
>>
>> What else do you think he is saying?
>

So, your claim that All Truth is PROVABLE is refuted.

Godel incompleteness Theory is Confirm, as is Tarski theory of no
"Definition" of Truth.

(Perhaps you don't undestand what he means by that)

Re: Tarski Undefinability Theorem is refuted

<toso7u$1g8qb$1@dont-email.me>

  copy mid

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

  copy link   Newsgroups: comp.theory comp.ai.philosophy sci.logic
Path: i2pn2.org!i2pn.org!eternal-september.org!reader01.eternal-september.org!.POSTED!not-for-mail
From: polco...@gmail.com (olcott)
Newsgroups: comp.theory,comp.ai.philosophy,sci.logic
Subject: Re: Tarski Undefinability Theorem is refuted
Date: Sun, 1 Jan 2023 13:51:25 -0600
Organization: A noiseless patient Spider
Lines: 213
Message-ID: <toso7u$1g8qb$1@dont-email.me>
References: <tokimd$c7q9$1@dont-email.me> <Y4lrL.204366$8_id.12194@fx09.iad>
<tokocm$ct3m$1@dont-email.me> <gymrL.58668$SdR7.1356@fx04.iad>
<toktee$ct3m$3@dont-email.me> <p6nrL.24263$5S78.3335@fx48.iad>
<ton062$mkig$1@dont-email.me> <c8ErL.153012$gGD7.51143@fx11.iad>
<ton3n7$msft$2@dont-email.me> <9DFrL.108564$Tcw8.7605@fx10.iad>
<tonqqm$plfv$1@dont-email.me> <mZLrL.430121$GNG9.49737@fx18.iad>
<toocgp$u29q$1@dont-email.me> <LqPrL.59543$SdR7.255@fx04.iad>
<topgct$11eou$2@dont-email.me> <2DYrL.31899$4jN7.6964@fx02.iad>
<topnro$12an3$1@dont-email.me> <7EZrL.24698$b7Kc.23514@fx39.iad>
<topqd9$12gbh$1@dont-email.me> <Q%_rL.14622$ZhSc.13601@fx38.iad>
<topvb5$12up5$1@dont-email.me> <rL%rL.14722$ZhSc.3153@fx38.iad>
<toq2ra$13eo3$1@dont-email.me> <yH0sL.25579$Lfzc.19594@fx36.iad>
<tosal9$1emtp$1@dont-email.me> <o3ksL.30783$Olad.13377@fx35.iad>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Sun, 1 Jan 2023 19:51:26 -0000 (UTC)
Injection-Info: reader01.eternal-september.org; posting-host="ec74fc7ff5b29acdb9caf17777acae89";
logging-data="1581899"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1/cTvozyx4bg1OZi8+5jJXV"
User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:102.0) Gecko/20100101
Thunderbird/102.6.1
Cancel-Lock: sha1:lSktwZPJ4qnYDMyuGZsBmAud+/g=
Content-Language: en-US
In-Reply-To: <o3ksL.30783$Olad.13377@fx35.iad>
 by: olcott - Sun, 1 Jan 2023 19:51 UTC

On 1/1/2023 12:13 PM, Richard Damon wrote:
> On 1/1/23 10:59 AM, olcott wrote:
>> On 12/31/2022 2:11 PM, Richard Damon wrote:
>>> On 12/31/22 2:34 PM, olcott wrote:
>>>> On 12/31/2022 1:07 PM, Richard Damon wrote:
>>>>> On 12/31/22 1:34 PM, olcott wrote:
>>>>>> On 12/31/2022 12:16 PM, Richard Damon wrote:
>>>>>>> On 12/31/22 12:10 PM, olcott wrote:
>>>>>>>
>>>>>>>> This sentence is not true.
>>>>>>>> is not true because it is self-contradictory.
>>>>>>>
>>>>>>> Right, and thus there can not be a Definition of Truth in the
>>>>>>> system because if there was, you could show that statement True.
>>>>>>
>>>>>> 這句話不是真的: "This sentence is not true."
>>>>>> The Chinese says "This sentence is not true:" referring to the
>>>>>> English.
>>>>>>
>>>>>> The Chinese sentence is true because the English sentence is
>>>>>> self-contradictory. This is an exact isomorphism to:
>>>>>>
>>>>>>    "sentence x which is undecidable in the original theory [my
>>>>>> English]
>>>>>>     becomes a decidable sentence in the enriched theory [my
>>>>>> Chinese]."
>>>>>>
>>>>>
>>>>> Which is a non-sequitor, showing you don't understand what you are
>>>>> talking about.
>>>>>
>>>>> You are just proving your Stupidity.
>>>>>
>>>>> I don't think you even actually understand any of the basics of logic.
>>>>>
>>>>> You can parrot words, but you show an utter lack of knowledge about
>>>>> how any of it works.
>>>>
>>>> Try and paraphrase 100% perfectly exactly what you think that Tarski is
>>>> saying. Any idiot (even a bot) can claim that someone is wrong.
>>>
>>> **Like you are doing**
>>>
>>>>
>>>> It takes actual understanding to point out the exact error and the
>>>> reason that it is an error.
>>>>
>>>>
>>>
>>> Why do we need to paraphrase?
>>>
>>> He says that a "Definition" of Truth, by which he means a way to
>>> determine if a given arbitrary sentence expressed in the Theory is
>>> True or False (or not a Truth Bearer) because, if such a definition
>>> existed, then from that definition you could prove in the defined
>>> Meta-Theory that a Statement like the Liar's Paradox was actually True.
>>>
>>
>> No that is incorrect. Tarski never indicated that he understood that
>> expressions of formal language are not necessarily truth bearers.
>
>
> Can yo PROVE that tement, have you read EVERYTHING he has written.
>

You made a claim that he understood this thus it is up to you to cite
your reference.

I claim that he does not understand this otherwise he would understand
that the Liar Paradox is not a truth bearer and would have explicitly
stated that: "the Liar Paradox is not a truth bearer".

> He actually seems to understand this, because he uses the fact that
> "proving" the Liar's Paradox, based on an assumed Thesis, shows the
> assumed Thesis must be false.

The way that Tarski said it: "This sentence is not true" is undecidable
in his theory and true in his meta-theory.

He never realized that what he really meant is that this sentence is not
true in his theory: "This sentence is not true"

and this sentence is true in his meta-theory:
{This sentence is not true: "This sentence is not true"}

>>
>> This sentence is true:
>> {The following sentence is not true: "This sentence is not true."}
>>
>>
>>> Thus, since we know that can't be,
>>
>> Try and think of any expression of language that is true entirely on the
>> basis of its meaning that does not have truthmaker connections to these
>> semantic meanings.
>
> No one is arguing that.

Hardly anyone seems to understand that the Liar Paradox is simply not a
truth bearer otherwise tertiary logic would have never been created.

Every logic system only has expressions of language that are {true,
false} or are not members of this formal system.

>>
>> If no such counter example exists in the universe then that proves that
>> I am correct about the requirement of semantic connections to truth
>> makers.
>
> Right, but that doesn't make it PROVABLE by the definition of Provable.
>

Every element of the set of analytic knowledge is provable and the
remaining elements of the set of analytic truth have unknown truth
values.

>>
>> Self-contradictory expressions of language have no truthmaker semantic
>> connections.
>>
>> This also applies to expressions of language that have vacuous truth
>> objects: "This sentence is true"
>>
>> True about what?
>> True about being true.
>> True about being true about what?
>> True about being true about being true.
>>
>> Ah I see an infinitely recursive structure that never is never resolved
>> to a truth value, thus not a truth bearer.
>
>
>
>>
>>> there must not be an ability to define in a system of logic, a
>>> "Definition of Truth" that allows you to determine (i.e. Proof) every
>>> True Statement, Disprove every false statement, and determine that
>>> every non-truthbearer was a non-truthbearer.
>>>
>>
>> The possible requirement of an infinite proof requires that some
>> expressions of language can only have an unknown Boolean value.
>> We can't even tell that they definitely require an infinite proof.
>
> Right, its value is unknown in that Thoery, and thus unprovable in that
> theory. A Meta-Theory may be able to show that it actually IS  true in
> that theory, and thus we have in the Theory a statment that actually is
> True (but not KNOWN to be true in the Theory) that is unprovable.
>

The correct "theory" of the set of analytic truth allows any order of
reference from 0th order logic no N-ary logic.

As Wittgenstein said true in a formal system means has been proved in
this formal system and false in this formal system means that the
opposite has been proved in this formal system.

Expressions of language currently having unknown truth values that
require infinite proofs are by definition not part of any formal system.

>>
>> The Goldbach Conjecture has a currently unknown Boolean value.
>> https://en.wikipedia.org/wiki/Goldbach%27s_conjecture
>> It does seem to be a truth bearer.
>>
>
> it MUST be a Truth Bearer, as either a number exists that breaks the
> rule, or no such number exist.
>

Yes I agree, that is what I said.

>> Analytic Knowledge is defined as expressions of language that have a
>> finite set of connections to their truth maker semantic meanings.
>>
>> Analytic Truth is defined as expressions of language that have a finite
>> or infinite set of connections to their truth maker semantic meanings.
>
> Right, so some Truths will be not knownable, and thus not Provable.
>

And also not part of any formal system.

>>
>> Non Truth Bearers are defined as expressions of language having no
>> connections to any truth maker semantic meanings.
>>
>>>
>>> What else do you think he is saying?
>>
>
> So, your claim that All Truth is PROVABLE is refuted.

I did not know that infinite proofs are not allowed.

What I meant was that every analytically true expression of language
must have a connection to its truth maker set of semantic meanings or it
is untrue. This connection is the proof of its truth.

>
> Godel incompleteness Theory is Confirm, as is Tarski theory of no
> "Definition" of Truth.
>
> (Perhaps you don't undestand what he means by that)

Both of these are only anchored in "epistemological antinomies" (self-
contradictory expressions) and thus both of these fail when these
expressions are rejected as not members of any formal system.

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

Re: Tarski Undefinability Theorem is refuted

<G2nsL.14828$ZhSc.8210@fx38.iad>

  copy mid

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

  copy link   Newsgroups: comp.theory comp.ai.philosophy sci.logic
Path: i2pn2.org!i2pn.org!usenet.blueworldhosting.com!feed1.usenet.blueworldhosting.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.6.1
Subject: Re: Tarski Undefinability Theorem is refuted
Content-Language: en-US
Newsgroups: comp.theory,comp.ai.philosophy,sci.logic
References: <tokimd$c7q9$1@dont-email.me> <Y4lrL.204366$8_id.12194@fx09.iad>
<tokocm$ct3m$1@dont-email.me> <gymrL.58668$SdR7.1356@fx04.iad>
<toktee$ct3m$3@dont-email.me> <p6nrL.24263$5S78.3335@fx48.iad>
<ton062$mkig$1@dont-email.me> <c8ErL.153012$gGD7.51143@fx11.iad>
<ton3n7$msft$2@dont-email.me> <9DFrL.108564$Tcw8.7605@fx10.iad>
<tonqqm$plfv$1@dont-email.me> <mZLrL.430121$GNG9.49737@fx18.iad>
<toocgp$u29q$1@dont-email.me> <LqPrL.59543$SdR7.255@fx04.iad>
<topgct$11eou$2@dont-email.me> <2DYrL.31899$4jN7.6964@fx02.iad>
<topnro$12an3$1@dont-email.me> <7EZrL.24698$b7Kc.23514@fx39.iad>
<topqd9$12gbh$1@dont-email.me> <Q%_rL.14622$ZhSc.13601@fx38.iad>
<topvb5$12up5$1@dont-email.me> <rL%rL.14722$ZhSc.3153@fx38.iad>
<toq2ra$13eo3$1@dont-email.me> <yH0sL.25579$Lfzc.19594@fx36.iad>
<tosal9$1emtp$1@dont-email.me> <o3ksL.30783$Olad.13377@fx35.iad>
<toso7u$1g8qb$1@dont-email.me>
From: Rich...@Damon-Family.org (Richard Damon)
In-Reply-To: <toso7u$1g8qb$1@dont-email.me>
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Lines: 372
Message-ID: <G2nsL.14828$ZhSc.8210@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: Sun, 1 Jan 2023 16:37:40 -0500
X-Received-Bytes: 15504
 by: Richard Damon - Sun, 1 Jan 2023 21:37 UTC

On 1/1/23 2:51 PM, olcott wrote:
> On 1/1/2023 12:13 PM, Richard Damon wrote:
>> On 1/1/23 10:59 AM, olcott wrote:
>>> On 12/31/2022 2:11 PM, Richard Damon wrote:
>>>> On 12/31/22 2:34 PM, olcott wrote:
>>>>> On 12/31/2022 1:07 PM, Richard Damon wrote:
>>>>>> On 12/31/22 1:34 PM, olcott wrote:
>>>>>>> On 12/31/2022 12:16 PM, Richard Damon wrote:
>>>>>>>> On 12/31/22 12:10 PM, olcott wrote:
>>>>>>>>
>>>>>>>>> This sentence is not true.
>>>>>>>>> is not true because it is self-contradictory.
>>>>>>>>
>>>>>>>> Right, and thus there can not be a Definition of Truth in the
>>>>>>>> system because if there was, you could show that statement True.
>>>>>>>
>>>>>>> 這句話不是真的: "This sentence is not true."
>>>>>>> The Chinese says "This sentence is not true:" referring to the
>>>>>>> English.
>>>>>>>
>>>>>>> The Chinese sentence is true because the English sentence is
>>>>>>> self-contradictory. This is an exact isomorphism to:
>>>>>>>
>>>>>>>    "sentence x which is undecidable in the original theory [my
>>>>>>> English]
>>>>>>>     becomes a decidable sentence in the enriched theory [my
>>>>>>> Chinese]."
>>>>>>>
>>>>>>
>>>>>> Which is a non-sequitor, showing you don't understand what you are
>>>>>> talking about.
>>>>>>
>>>>>> You are just proving your Stupidity.
>>>>>>
>>>>>> I don't think you even actually understand any of the basics of
>>>>>> logic.
>>>>>>
>>>>>> You can parrot words, but you show an utter lack of knowledge
>>>>>> about how any of it works.
>>>>>
>>>>> Try and paraphrase 100% perfectly exactly what you think that
>>>>> Tarski is
>>>>> saying. Any idiot (even a bot) can claim that someone is wrong.
>>>>
>>>> **Like you are doing**
>>>>
>>>>>
>>>>> It takes actual understanding to point out the exact error and the
>>>>> reason that it is an error.
>>>>>
>>>>>
>>>>
>>>> Why do we need to paraphrase?
>>>>
>>>> He says that a "Definition" of Truth, by which he means a way to
>>>> determine if a given arbitrary sentence expressed in the Theory is
>>>> True or False (or not a Truth Bearer) because, if such a definition
>>>> existed, then from that definition you could prove in the defined
>>>> Meta-Theory that a Statement like the Liar's Paradox was actually True.
>>>>
>>>
>>> No that is incorrect. Tarski never indicated that he understood that
>>> expressions of formal language are not necessarily truth bearers.
>>
>>
>> Can yo PROVE that tement, have you read EVERYTHING he has written.
>>
>
> You made a claim that he understood this thus it is up to you to cite
> your reference.

I did.

>
> I claim that he does not understand this otherwise he would understand
> that the Liar Paradox is not a truth bearer and would have explicitly
> stated that: "the Liar Paradox is not a truth bearer".

He knows that, that is why he points out that the fact that the
assumption of the existance of a Definition of Truth with the system,
the assumption of which allows him to prove (based on that assumption)
that the liar paradox is true, shows that it is impossible for there to
be a Defiition of Truth within the logic system.

What don't YOU understand about that statement?

>
>> He actually seems to understand this, because he uses the fact that
>> "proving" the Liar's Paradox, based on an assumed Thesis, shows the
>> assumed Thesis must be false.
>
> The way that Tarski said it: "This sentence is not true" is undecidable
> in his theory and true in his meta-theory.

BASED ON THE ASSUMPTION OF THESIS A.

Thus, THESIS A can't be true.

>
> He never realized that what he really meant is that this sentence is not
> true in his theory: "This sentence is not true"
>
> and this sentence is true in his meta-theory:
> {This sentence is not true: "This sentence is not true"}

Nope, that ISN'T what he is talking about. You just are not
understanding his words.

You have shown enough misundetandings, the most like cause of any
disagreement between you and a respected logictian is that you don't
actually understand what he is saying.

This is also a natural outcome of your MISAPPLICATION of the concept of
"First Principles".

>
>>>
>>> This sentence is true:
>>> {The following sentence is not true: "This sentence is not true."}
>>>
>>>
>>>> Thus, since we know that can't be,
>>>
>>> Try and think of any expression of language that is true entirely on the
>>> basis of its meaning that does not have truthmaker connections to these
>>> semantic meanings.
>>
>> No one is arguing that.
>
> Hardly anyone seems to understand that the Liar Paradox is simply not a
> truth bearer otherwise tertiary logic would have never been created.

No Nearly EVERYONE understands that in Binary Logic, the Liar Paracos is
simply not a Truth Bearer.

Things like tertiary Logic are attempts to expand the logic system to
see if a system of logic could handle it.

You DO understand the concepts of differing systems of logic with
different ground rules, don't you?

Maybe you don't as that concept breaks you idea of an overarching
Meta-system that all logic falls under.

>
> Every logic system only has expressions of language that are {true,
> false} or are not members of this formal system.

Note members of THIS group of formal systems.

Other formal systems have other values in their logic.

>
>>>
>>> If no such counter example exists in the universe then that proves that
>>> I am correct about the requirement of semantic connections to truth
>>> makers.
>>
>> Right, but that doesn't make it PROVABLE by the definition of Provable.
>>
>
> Every element of the set of analytic knowledge is provable and the
> remaining elements of the set of analytic truth have unknown truth
> values.

Yes, KNOWLEDGE is Provavle.

TRUTH is not necessarily, as it may have an infinite set of connections,
which makes it outside the normal definition of Knowable.

>
>>>
>>> Self-contradictory expressions of language have no truthmaker
>>> semantic connections.
>>>
>>> This also applies to expressions of language that have vacuous truth
>>> objects: "This sentence is true"
>>>
>>> True about what?
>>> True about being true.
>>> True about being true about what?
>>> True about being true about being true.
>>>
>>> Ah I see an infinitely recursive structure that never is never resolved
>>> to a truth value, thus not a truth bearer.
>>
>>
>>
>>>
>>>> there must not be an ability to define in a system of logic, a
>>>> "Definition of Truth" that allows you to determine (i.e. Proof)
>>>> every True Statement, Disprove every false statement, and determine
>>>> that every non-truthbearer was a non-truthbearer.
>>>>
>>>
>>> The possible requirement of an infinite proof requires that some
>>> expressions of language can only have an unknown Boolean value.
>>> We can't even tell that they definitely require an infinite proof.
>>
>> Right, its value is unknown in that Thoery, and thus unprovable in
>> that theory. A Meta-Theory may be able to show that it actually IS
>> true in that theory, and thus we have in the Theory a statment that
>> actually is True (but not KNOWN to be true in the Theory) that is
>> unprovable.
>>
>
> The correct "theory" of the set of analytic truth allows any order of
> reference from 0th order logic no N-ary logic.
>
> As Wittgenstein said true in a formal system means has been proved in
> this formal system and false in this formal system means that the
> opposite has been proved in this formal system.


Click here to read the complete article
Re: Tarski Undefinability Theorem is refuted

<tosuq7$1gq8u$1@dont-email.me>

  copy mid

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

  copy link   Newsgroups: comp.theory comp.ai.philosophy sci.logic
Path: i2pn2.org!i2pn.org!eternal-september.org!reader01.eternal-september.org!.POSTED!not-for-mail
From: polco...@gmail.com (olcott)
Newsgroups: comp.theory,comp.ai.philosophy,sci.logic
Subject: Re: Tarski Undefinability Theorem is refuted
Date: Sun, 1 Jan 2023 15:43:35 -0600
Organization: A noiseless patient Spider
Lines: 56
Message-ID: <tosuq7$1gq8u$1@dont-email.me>
References: <tokimd$c7q9$1@dont-email.me> <Y4lrL.204366$8_id.12194@fx09.iad>
<tokocm$ct3m$1@dont-email.me> <gymrL.58668$SdR7.1356@fx04.iad>
<toktee$ct3m$3@dont-email.me> <p6nrL.24263$5S78.3335@fx48.iad>
<ton062$mkig$1@dont-email.me> <c8ErL.153012$gGD7.51143@fx11.iad>
<ton3n7$msft$2@dont-email.me> <9DFrL.108564$Tcw8.7605@fx10.iad>
<tonqqm$plfv$1@dont-email.me> <mZLrL.430121$GNG9.49737@fx18.iad>
<toocgp$u29q$1@dont-email.me> <LqPrL.59543$SdR7.255@fx04.iad>
<topgct$11eou$2@dont-email.me> <2DYrL.31899$4jN7.6964@fx02.iad>
<topnro$12an3$1@dont-email.me> <7EZrL.24698$b7Kc.23514@fx39.iad>
<topqd9$12gbh$1@dont-email.me> <Q%_rL.14622$ZhSc.13601@fx38.iad>
<topvb5$12up5$1@dont-email.me> <rL%rL.14722$ZhSc.3153@fx38.iad>
<toq2ra$13eo3$1@dont-email.me> <yH0sL.25579$Lfzc.19594@fx36.iad>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Sun, 1 Jan 2023 21:43:35 -0000 (UTC)
Injection-Info: reader01.eternal-september.org; posting-host="ec74fc7ff5b29acdb9caf17777acae89";
logging-data="1599774"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX19zQu79+JqHelvqxF52t7ib"
User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:102.0) Gecko/20100101
Thunderbird/102.6.1
Cancel-Lock: sha1:yJv7EPMweFca9ZmFsorRNFO9JOA=
Content-Language: en-US
In-Reply-To: <yH0sL.25579$Lfzc.19594@fx36.iad>
 by: olcott - Sun, 1 Jan 2023 21:43 UTC

On 12/31/2022 2:11 PM, Richard Damon wrote:
> On 12/31/22 2:34 PM, olcott wrote:
>> On 12/31/2022 1:07 PM, Richard Damon wrote:
>>> On 12/31/22 1:34 PM, olcott wrote:
>>>> On 12/31/2022 12:16 PM, Richard Damon wrote:
>>>>> On 12/31/22 12:10 PM, olcott wrote:
>>>>>
>>>>>> This sentence is not true.
>>>>>> is not true because it is self-contradictory.
>>>>>
>>>>> Right, and thus there can not be a Definition of Truth in the
>>>>> system because if there was, you could show that statement True.
>>>>
>>>> 這句話不是真的: "This sentence is not true."
>>>> The Chinese says "This sentence is not true:" referring to the English.
>>>>
>>>> The Chinese sentence is true because the English sentence is
>>>> self-contradictory. This is an exact isomorphism to:
>>>>
>>>>    "sentence x which is undecidable in the original theory [my English]
>>>>     becomes a decidable sentence in the enriched theory [my Chinese]."
>>>>
>>>
>>> Which is a non-sequitor, showing you don't understand what you are
>>> talking about.
>>>
>>> You are just proving your Stupidity.
>>>
>>> I don't think you even actually understand any of the basics of logic.
>>>
>>> You can parrot words, but you show an utter lack of knowledge about
>>> how any of it works.
>>
>> Try and paraphrase 100% perfectly exactly what you think that Tarski is
>> saying. Any idiot (even a bot) can claim that someone is wrong.
>
> **Like you are doing**
>
>>
>> It takes actual understanding to point out the exact error and the
>> reason that it is an error.
>>
>>
>
> Why do we need to paraphrase?
>
> He says that a "Definition" of Truth, by which he means a way to
> determine if a given arbitrary sentence expressed in the Theory is True
> or False (or not a Truth Bearer) because, if such a definition existed,
He does not use the term "truth bearer". Please cite word-for-word what
he said and the page number of the book where he said it.

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

Re: Tarski Undefinability Theorem is refuted

<tosus5$1gq8u$2@dont-email.me>

  copy mid

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

  copy link   Newsgroups: comp.theory comp.ai.philosophy sci.logic
Path: i2pn2.org!i2pn.org!eternal-september.org!reader01.eternal-september.org!.POSTED!not-for-mail
From: polco...@gmail.com (olcott)
Newsgroups: comp.theory,comp.ai.philosophy,sci.logic
Subject: Re: Tarski Undefinability Theorem is refuted
Date: Sun, 1 Jan 2023 15:44:37 -0600
Organization: A noiseless patient Spider
Lines: 93
Message-ID: <tosus5$1gq8u$2@dont-email.me>
References: <tokimd$c7q9$1@dont-email.me> <Y4lrL.204366$8_id.12194@fx09.iad>
<tokocm$ct3m$1@dont-email.me> <gymrL.58668$SdR7.1356@fx04.iad>
<toktee$ct3m$3@dont-email.me> <p6nrL.24263$5S78.3335@fx48.iad>
<ton062$mkig$1@dont-email.me> <c8ErL.153012$gGD7.51143@fx11.iad>
<ton3n7$msft$2@dont-email.me> <9DFrL.108564$Tcw8.7605@fx10.iad>
<tonqqm$plfv$1@dont-email.me> <mZLrL.430121$GNG9.49737@fx18.iad>
<toocgp$u29q$1@dont-email.me> <LqPrL.59543$SdR7.255@fx04.iad>
<topgct$11eou$2@dont-email.me> <2DYrL.31899$4jN7.6964@fx02.iad>
<topnro$12an3$1@dont-email.me> <7EZrL.24698$b7Kc.23514@fx39.iad>
<topqd9$12gbh$1@dont-email.me> <Q%_rL.14622$ZhSc.13601@fx38.iad>
<topvb5$12up5$1@dont-email.me> <rL%rL.14722$ZhSc.3153@fx38.iad>
<toq2ra$13eo3$1@dont-email.me> <yH0sL.25579$Lfzc.19594@fx36.iad>
<tosal9$1emtp$1@dont-email.me> <o3ksL.30783$Olad.13377@fx35.iad>
<toso7u$1g8qb$1@dont-email.me> <G2nsL.14828$ZhSc.8210@fx38.iad>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Sun, 1 Jan 2023 21:44:37 -0000 (UTC)
Injection-Info: reader01.eternal-september.org; posting-host="ec74fc7ff5b29acdb9caf17777acae89";
logging-data="1599774"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX19dEKPngJZT4zFEe4OdurAr"
User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:102.0) Gecko/20100101
Thunderbird/102.6.1
Cancel-Lock: sha1:aITyp5dEQcx2E83NQnx6R9SJ97I=
Content-Language: en-US
In-Reply-To: <G2nsL.14828$ZhSc.8210@fx38.iad>
 by: olcott - Sun, 1 Jan 2023 21:44 UTC

On 1/1/2023 3:37 PM, Richard Damon wrote:
> On 1/1/23 2:51 PM, olcott wrote:
>> On 1/1/2023 12:13 PM, Richard Damon wrote:
>>> On 1/1/23 10:59 AM, olcott wrote:
>>>> On 12/31/2022 2:11 PM, Richard Damon wrote:
>>>>> On 12/31/22 2:34 PM, olcott wrote:
>>>>>> On 12/31/2022 1:07 PM, Richard Damon wrote:
>>>>>>> On 12/31/22 1:34 PM, olcott wrote:
>>>>>>>> On 12/31/2022 12:16 PM, Richard Damon wrote:
>>>>>>>>> On 12/31/22 12:10 PM, olcott wrote:
>>>>>>>>>
>>>>>>>>>> This sentence is not true.
>>>>>>>>>> is not true because it is self-contradictory.
>>>>>>>>>
>>>>>>>>> Right, and thus there can not be a Definition of Truth in the
>>>>>>>>> system because if there was, you could show that statement True.
>>>>>>>>
>>>>>>>> 這句話不是真的: "This sentence is not true."
>>>>>>>> The Chinese says "This sentence is not true:" referring to the
>>>>>>>> English.
>>>>>>>>
>>>>>>>> The Chinese sentence is true because the English sentence is
>>>>>>>> self-contradictory. This is an exact isomorphism to:
>>>>>>>>
>>>>>>>>    "sentence x which is undecidable in the original theory [my
>>>>>>>> English]
>>>>>>>>     becomes a decidable sentence in the enriched theory [my
>>>>>>>> Chinese]."
>>>>>>>>
>>>>>>>
>>>>>>> Which is a non-sequitor, showing you don't understand what you
>>>>>>> are talking about.
>>>>>>>
>>>>>>> You are just proving your Stupidity.
>>>>>>>
>>>>>>> I don't think you even actually understand any of the basics of
>>>>>>> logic.
>>>>>>>
>>>>>>> You can parrot words, but you show an utter lack of knowledge
>>>>>>> about how any of it works.
>>>>>>
>>>>>> Try and paraphrase 100% perfectly exactly what you think that
>>>>>> Tarski is
>>>>>> saying. Any idiot (even a bot) can claim that someone is wrong.
>>>>>
>>>>> **Like you are doing**
>>>>>
>>>>>>
>>>>>> It takes actual understanding to point out the exact error and the
>>>>>> reason that it is an error.
>>>>>>
>>>>>>
>>>>>
>>>>> Why do we need to paraphrase?
>>>>>
>>>>> He says that a "Definition" of Truth, by which he means a way to
>>>>> determine if a given arbitrary sentence expressed in the Theory is
>>>>> True or False (or not a Truth Bearer) because, if such a definition
>>>>> existed, then from that definition you could prove in the defined
>>>>> Meta-Theory that a Statement like the Liar's Paradox was actually
>>>>> True.
>>>>>
>>>>
>>>> No that is incorrect. Tarski never indicated that he understood that
>>>> expressions of formal language are not necessarily truth bearers.
>>>
>>>
>>> Can yo PROVE that tement, have you read EVERYTHING he has written.
>>>
>>
>> You made a claim that he understood this thus it is up to you to cite
>> your reference.
>
> I did.
>
>>
>> I claim that he does not understand this otherwise he would understand
>> that the Liar Paradox is not a truth bearer and would have explicitly
>> stated that: "the Liar Paradox is not a truth bearer".
>
> He knows that, that is why he points out that the fact that the
> assumption of the existance of a Definition of Truth with the system,
> the assumption of which allows him to prove (based on that assumption)
> that the liar paradox is true, shows that it is impossible for there to
> be a Defiition of Truth within the logic system.
>

He never said anything like that.

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

Re: Tarski Undefinability Theorem is refuted

<QinsL.14830$ZhSc.27@fx38.iad>

  copy mid

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

  copy link   Newsgroups: comp.theory comp.ai.philosophy sci.logic
Path: i2pn2.org!i2pn.org!usenet.blueworldhosting.com!feed1.usenet.blueworldhosting.com!peer03.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.6.1
Subject: Re: Tarski Undefinability Theorem is refuted
Content-Language: en-US
Newsgroups: comp.theory,comp.ai.philosophy,sci.logic
References: <tokimd$c7q9$1@dont-email.me> <Y4lrL.204366$8_id.12194@fx09.iad>
<tokocm$ct3m$1@dont-email.me> <gymrL.58668$SdR7.1356@fx04.iad>
<toktee$ct3m$3@dont-email.me> <p6nrL.24263$5S78.3335@fx48.iad>
<ton062$mkig$1@dont-email.me> <c8ErL.153012$gGD7.51143@fx11.iad>
<ton3n7$msft$2@dont-email.me> <9DFrL.108564$Tcw8.7605@fx10.iad>
<tonqqm$plfv$1@dont-email.me> <mZLrL.430121$GNG9.49737@fx18.iad>
<toocgp$u29q$1@dont-email.me> <LqPrL.59543$SdR7.255@fx04.iad>
<topgct$11eou$2@dont-email.me> <2DYrL.31899$4jN7.6964@fx02.iad>
<topnro$12an3$1@dont-email.me> <7EZrL.24698$b7Kc.23514@fx39.iad>
<topqd9$12gbh$1@dont-email.me> <Q%_rL.14622$ZhSc.13601@fx38.iad>
<topvb5$12up5$1@dont-email.me> <rL%rL.14722$ZhSc.3153@fx38.iad>
<toq2ra$13eo3$1@dont-email.me> <yH0sL.25579$Lfzc.19594@fx36.iad>
<tosuq7$1gq8u$1@dont-email.me>
From: Rich...@Damon-Family.org (Richard Damon)
In-Reply-To: <tosuq7$1gq8u$1@dont-email.me>
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Lines: 81
Message-ID: <QinsL.14830$ZhSc.27@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: Sun, 1 Jan 2023 16:54:54 -0500
X-Received-Bytes: 4542
 by: Richard Damon - Sun, 1 Jan 2023 21:54 UTC

On 1/1/23 4:43 PM, olcott wrote:
> On 12/31/2022 2:11 PM, Richard Damon wrote:
>> On 12/31/22 2:34 PM, olcott wrote:
>>> On 12/31/2022 1:07 PM, Richard Damon wrote:
>>>> On 12/31/22 1:34 PM, olcott wrote:
>>>>> On 12/31/2022 12:16 PM, Richard Damon wrote:
>>>>>> On 12/31/22 12:10 PM, olcott wrote:
>>>>>>
>>>>>>> This sentence is not true.
>>>>>>> is not true because it is self-contradictory.
>>>>>>
>>>>>> Right, and thus there can not be a Definition of Truth in the
>>>>>> system because if there was, you could show that statement True.
>>>>>
>>>>> 這句話不是真的: "This sentence is not true."
>>>>> The Chinese says "This sentence is not true:" referring to the
>>>>> English.
>>>>>
>>>>> The Chinese sentence is true because the English sentence is
>>>>> self-contradictory. This is an exact isomorphism to:
>>>>>
>>>>>    "sentence x which is undecidable in the original theory [my
>>>>> English]
>>>>>     becomes a decidable sentence in the enriched theory [my Chinese]."
>>>>>
>>>>
>>>> Which is a non-sequitor, showing you don't understand what you are
>>>> talking about.
>>>>
>>>> You are just proving your Stupidity.
>>>>
>>>> I don't think you even actually understand any of the basics of logic.
>>>>
>>>> You can parrot words, but you show an utter lack of knowledge about
>>>> how any of it works.
>>>
>>> Try and paraphrase 100% perfectly exactly what you think that Tarski is
>>> saying. Any idiot (even a bot) can claim that someone is wrong.
>>
>> **Like you are doing**
>>
>>>
>>> It takes actual understanding to point out the exact error and the
>>> reason that it is an error.
>>>
>>>
>>
>> Why do we need to paraphrase?
>>
>> He says that a "Definition" of Truth, by which he means a way to
>> determine if a given arbitrary sentence expressed in the Theory is
>> True or False (or not a Truth Bearer) because, if such a definition
>> existed,
> He does not use the term "truth bearer". Please cite word-for-word what
> he said and the page number of the book where he said it.
>

Sorry, I don't have his book, but am going off of the general principles
I know of what he has done.

He also might not use that exact term, but others that express the same
meaning.

You are just proving your stupidity, as you claim errors for people that
they do not make.

YOU make plenty of errors, as you show yourself incapable of performing
basic logic.

You have yet to point out which line of the actual proof of any of the
proofs you object to that has a demonstratable logical error.

Until you do that, your claim that they made a mistake is not established.

All you have done is to disagree with their conclusion, so you claim
they must have made a mistake.

By THAT logic, YOU MUST have made a mistake too, as your conclusing
disagree with the proven theory.

YOU FAIL.

Re: Tarski Undefinability Theorem is refuted

<imnsL.14831$ZhSc.6098@fx38.iad>

  copy mid

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

  copy link   Newsgroups: comp.theory comp.ai.philosophy sci.logic
Path: i2pn2.org!i2pn.org!usenet.blueworldhosting.com!feed1.usenet.blueworldhosting.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.6.1
Subject: Re: Tarski Undefinability Theorem is refuted
Content-Language: en-US
Newsgroups: comp.theory,comp.ai.philosophy,sci.logic
References: <tokimd$c7q9$1@dont-email.me> <Y4lrL.204366$8_id.12194@fx09.iad>
<tokocm$ct3m$1@dont-email.me> <gymrL.58668$SdR7.1356@fx04.iad>
<toktee$ct3m$3@dont-email.me> <p6nrL.24263$5S78.3335@fx48.iad>
<ton062$mkig$1@dont-email.me> <c8ErL.153012$gGD7.51143@fx11.iad>
<ton3n7$msft$2@dont-email.me> <9DFrL.108564$Tcw8.7605@fx10.iad>
<tonqqm$plfv$1@dont-email.me> <mZLrL.430121$GNG9.49737@fx18.iad>
<toocgp$u29q$1@dont-email.me> <LqPrL.59543$SdR7.255@fx04.iad>
<topgct$11eou$2@dont-email.me> <2DYrL.31899$4jN7.6964@fx02.iad>
<topnro$12an3$1@dont-email.me> <7EZrL.24698$b7Kc.23514@fx39.iad>
<topqd9$12gbh$1@dont-email.me> <Q%_rL.14622$ZhSc.13601@fx38.iad>
<topvb5$12up5$1@dont-email.me> <rL%rL.14722$ZhSc.3153@fx38.iad>
<toq2ra$13eo3$1@dont-email.me> <yH0sL.25579$Lfzc.19594@fx36.iad>
<tosal9$1emtp$1@dont-email.me> <o3ksL.30783$Olad.13377@fx35.iad>
<toso7u$1g8qb$1@dont-email.me> <G2nsL.14828$ZhSc.8210@fx38.iad>
<tosus5$1gq8u$2@dont-email.me>
From: Rich...@Damon-Family.org (Richard Damon)
In-Reply-To: <tosus5$1gq8u$2@dont-email.me>
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 7bit
Lines: 23
Message-ID: <imnsL.14831$ZhSc.6098@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: Sun, 1 Jan 2023 16:58:36 -0500
X-Received-Bytes: 2673
 by: Richard Damon - Sun, 1 Jan 2023 21:58 UTC

On 1/1/23 4:44 PM, olcott wrote:
> On 1/1/2023 3:37 PM, Richard Damon wrote:
>> On 1/1/23 2:51 PM, olcott wrote:

>>>
>>> I claim that he does not understand this otherwise he would
>>> understand that the Liar Paradox is not a truth bearer and would have
>>> explicitly stated that: "the Liar Paradox is not a truth bearer".
>>
>> He knows that, that is why he points out that the fact that the
>> assumption of the existance of a Definition of Truth with the system,
>> the assumption of which allows him to prove (based on that assumption)
>> that the liar paradox is true, shows that it is impossible for there
>> to be a Defiition of Truth within the logic system.
>>
>
> He never said anything like that.
>

Yes, that is the whole basis of his proof.

You just don't understand it because it seems you haven't actually read
his proof, just his sketch of the proof.

Re: Tarski Undefinability Theorem is refuted

<tot03c$1gq8u$3@dont-email.me>

  copy mid

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

  copy link   Newsgroups: comp.theory comp.ai.philosophy sci.logic
Path: i2pn2.org!i2pn.org!eternal-september.org!reader01.eternal-september.org!.POSTED!not-for-mail
From: polco...@gmail.com (olcott)
Newsgroups: comp.theory,comp.ai.philosophy,sci.logic
Subject: Re: Tarski Undefinability Theorem is refuted
Date: Sun, 1 Jan 2023 16:05:31 -0600
Organization: A noiseless patient Spider
Lines: 68
Message-ID: <tot03c$1gq8u$3@dont-email.me>
References: <tokimd$c7q9$1@dont-email.me> <Y4lrL.204366$8_id.12194@fx09.iad>
<tokocm$ct3m$1@dont-email.me> <gymrL.58668$SdR7.1356@fx04.iad>
<toktee$ct3m$3@dont-email.me> <p6nrL.24263$5S78.3335@fx48.iad>
<ton062$mkig$1@dont-email.me> <c8ErL.153012$gGD7.51143@fx11.iad>
<ton3n7$msft$2@dont-email.me> <9DFrL.108564$Tcw8.7605@fx10.iad>
<tonqqm$plfv$1@dont-email.me> <mZLrL.430121$GNG9.49737@fx18.iad>
<toocgp$u29q$1@dont-email.me> <LqPrL.59543$SdR7.255@fx04.iad>
<topgct$11eou$2@dont-email.me> <2DYrL.31899$4jN7.6964@fx02.iad>
<topnro$12an3$1@dont-email.me> <7EZrL.24698$b7Kc.23514@fx39.iad>
<topqd9$12gbh$1@dont-email.me> <Q%_rL.14622$ZhSc.13601@fx38.iad>
<topvb5$12up5$1@dont-email.me> <rL%rL.14722$ZhSc.3153@fx38.iad>
<toq2ra$13eo3$1@dont-email.me> <yH0sL.25579$Lfzc.19594@fx36.iad>
<tosuq7$1gq8u$1@dont-email.me> <QinsL.14830$ZhSc.27@fx38.iad>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Sun, 1 Jan 2023 22:05:32 -0000 (UTC)
Injection-Info: reader01.eternal-september.org; posting-host="ec74fc7ff5b29acdb9caf17777acae89";
logging-data="1599774"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1/yGkGEoIcBxQsRCwZHXX7G"
User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:102.0) Gecko/20100101
Thunderbird/102.6.1
Cancel-Lock: sha1:NTeSu0IE3l6LqKz43MysICMz8VE=
In-Reply-To: <QinsL.14830$ZhSc.27@fx38.iad>
Content-Language: en-US
 by: olcott - Sun, 1 Jan 2023 22:05 UTC

On 1/1/2023 3:54 PM, Richard Damon wrote:
> On 1/1/23 4:43 PM, olcott wrote:
>> On 12/31/2022 2:11 PM, Richard Damon wrote:
>>> On 12/31/22 2:34 PM, olcott wrote:
>>>> On 12/31/2022 1:07 PM, Richard Damon wrote:
>>>>> On 12/31/22 1:34 PM, olcott wrote:
>>>>>> On 12/31/2022 12:16 PM, Richard Damon wrote:
>>>>>>> On 12/31/22 12:10 PM, olcott wrote:
>>>>>>>
>>>>>>>> This sentence is not true.
>>>>>>>> is not true because it is self-contradictory.
>>>>>>>
>>>>>>> Right, and thus there can not be a Definition of Truth in the
>>>>>>> system because if there was, you could show that statement True.
>>>>>>
>>>>>> 這句話不是真的: "This sentence is not true."
>>>>>> The Chinese says "This sentence is not true:" referring to the
>>>>>> English.
>>>>>>
>>>>>> The Chinese sentence is true because the English sentence is
>>>>>> self-contradictory. This is an exact isomorphism to:
>>>>>>
>>>>>>    "sentence x which is undecidable in the original theory [my
>>>>>> English]
>>>>>>     becomes a decidable sentence in the enriched theory [my
>>>>>> Chinese]."
>>>>>>
>>>>>
>>>>> Which is a non-sequitor, showing you don't understand what you are
>>>>> talking about.
>>>>>
>>>>> You are just proving your Stupidity.
>>>>>
>>>>> I don't think you even actually understand any of the basics of logic.
>>>>>
>>>>> You can parrot words, but you show an utter lack of knowledge about
>>>>> how any of it works.
>>>>
>>>> Try and paraphrase 100% perfectly exactly what you think that Tarski is
>>>> saying. Any idiot (even a bot) can claim that someone is wrong.
>>>
>>> **Like you are doing**
>>>
>>>>
>>>> It takes actual understanding to point out the exact error and the
>>>> reason that it is an error.
>>>>
>>>>
>>>
>>> Why do we need to paraphrase?
>>>
>>> He says that a "Definition" of Truth, by which he means a way to
>>> determine if a given arbitrary sentence expressed in the Theory is
>>> True or False (or not a Truth Bearer) because, if such a definition
>>> existed,
>> He does not use the term "truth bearer". Please cite word-for-word
>> what he said and the page number of the book where he said it.
>>
>
> Sorry, I don't have his book, but am going off of the general principles
> I know of what he has done.
>
OK so you did not can cannot support your claim, thus your claim is
rejected as baseless.

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

Re: Tarski Undefinability Theorem is refuted

<tot091$1gq8u$4@dont-email.me>

  copy mid

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

  copy link   Newsgroups: comp.theory comp.ai.philosophy sci.logic
Path: i2pn2.org!i2pn.org!eternal-september.org!reader01.eternal-september.org!.POSTED!not-for-mail
From: polco...@gmail.com (olcott)
Newsgroups: comp.theory,comp.ai.philosophy,sci.logic
Subject: Re: Tarski Undefinability Theorem is refuted
Date: Sun, 1 Jan 2023 16:08:33 -0600
Organization: A noiseless patient Spider
Lines: 35
Message-ID: <tot091$1gq8u$4@dont-email.me>
References: <tokimd$c7q9$1@dont-email.me> <Y4lrL.204366$8_id.12194@fx09.iad>
<tokocm$ct3m$1@dont-email.me> <gymrL.58668$SdR7.1356@fx04.iad>
<toktee$ct3m$3@dont-email.me> <p6nrL.24263$5S78.3335@fx48.iad>
<ton062$mkig$1@dont-email.me> <c8ErL.153012$gGD7.51143@fx11.iad>
<ton3n7$msft$2@dont-email.me> <9DFrL.108564$Tcw8.7605@fx10.iad>
<tonqqm$plfv$1@dont-email.me> <mZLrL.430121$GNG9.49737@fx18.iad>
<toocgp$u29q$1@dont-email.me> <LqPrL.59543$SdR7.255@fx04.iad>
<topgct$11eou$2@dont-email.me> <2DYrL.31899$4jN7.6964@fx02.iad>
<topnro$12an3$1@dont-email.me> <7EZrL.24698$b7Kc.23514@fx39.iad>
<topqd9$12gbh$1@dont-email.me> <Q%_rL.14622$ZhSc.13601@fx38.iad>
<topvb5$12up5$1@dont-email.me> <rL%rL.14722$ZhSc.3153@fx38.iad>
<toq2ra$13eo3$1@dont-email.me> <yH0sL.25579$Lfzc.19594@fx36.iad>
<tosal9$1emtp$1@dont-email.me> <o3ksL.30783$Olad.13377@fx35.iad>
<toso7u$1g8qb$1@dont-email.me> <G2nsL.14828$ZhSc.8210@fx38.iad>
<tosus5$1gq8u$2@dont-email.me> <imnsL.14831$ZhSc.6098@fx38.iad>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 7bit
Injection-Date: Sun, 1 Jan 2023 22:08:33 -0000 (UTC)
Injection-Info: reader01.eternal-september.org; posting-host="ec74fc7ff5b29acdb9caf17777acae89";
logging-data="1599774"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX19GH6aGlKr03IV/qkjf0K8i"
User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:102.0) Gecko/20100101
Thunderbird/102.6.1
Cancel-Lock: sha1:yEwTqcP9BsFLGu/zlYF0niyIbxE=
Content-Language: en-US
In-Reply-To: <imnsL.14831$ZhSc.6098@fx38.iad>
 by: olcott - Sun, 1 Jan 2023 22:08 UTC

On 1/1/2023 3:58 PM, Richard Damon wrote:
> On 1/1/23 4:44 PM, olcott wrote:
>> On 1/1/2023 3:37 PM, Richard Damon wrote:
>>> On 1/1/23 2:51 PM, olcott wrote:
>
>>>>
>>>> I claim that he does not understand this otherwise he would
>>>> understand that the Liar Paradox is not a truth bearer and would
>>>> have explicitly stated that: "the Liar Paradox is not a truth bearer".
>>>
>>> He knows that, that is why he points out that the fact that the
>>> assumption of the existance of a Definition of Truth with the system,
>>> the assumption of which allows him to prove (based on that
>>> assumption) that the liar paradox is true, shows that it is
>>> impossible for there to be a Defiition of Truth within the logic system.
>>>
>>
>> He never said anything like that.
>>
>
> Yes, that is the whole basis of his proof.
>
> You just don't understand it because it seems you haven't actually read
> his proof, just his sketch of the proof.

Cite your sources. The proof that I cited is his entire proof in his own
words not some Wikipedia summation.

His proof was added as an afterthought to a paper that he had already
published.

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

Re: Tarski Undefinability Theorem is refuted

<LAnsL.14833$ZhSc.9405@fx38.iad>

  copy mid

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

  copy link   Newsgroups: comp.theory comp.ai.philosophy sci.logic
Path: i2pn2.org!i2pn.org!usenet.blueworldhosting.com!feed1.usenet.blueworldhosting.com!peer03.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.6.1
Subject: Re: Tarski Undefinability Theorem is refuted
Content-Language: en-US
Newsgroups: comp.theory,comp.ai.philosophy,sci.logic
References: <tokimd$c7q9$1@dont-email.me> <Y4lrL.204366$8_id.12194@fx09.iad>
<tokocm$ct3m$1@dont-email.me> <gymrL.58668$SdR7.1356@fx04.iad>
<toktee$ct3m$3@dont-email.me> <p6nrL.24263$5S78.3335@fx48.iad>
<ton062$mkig$1@dont-email.me> <c8ErL.153012$gGD7.51143@fx11.iad>
<ton3n7$msft$2@dont-email.me> <9DFrL.108564$Tcw8.7605@fx10.iad>
<tonqqm$plfv$1@dont-email.me> <mZLrL.430121$GNG9.49737@fx18.iad>
<toocgp$u29q$1@dont-email.me> <LqPrL.59543$SdR7.255@fx04.iad>
<topgct$11eou$2@dont-email.me> <2DYrL.31899$4jN7.6964@fx02.iad>
<topnro$12an3$1@dont-email.me> <7EZrL.24698$b7Kc.23514@fx39.iad>
<topqd9$12gbh$1@dont-email.me> <Q%_rL.14622$ZhSc.13601@fx38.iad>
<topvb5$12up5$1@dont-email.me> <rL%rL.14722$ZhSc.3153@fx38.iad>
<toq2ra$13eo3$1@dont-email.me> <yH0sL.25579$Lfzc.19594@fx36.iad>
<tosuq7$1gq8u$1@dont-email.me> <QinsL.14830$ZhSc.27@fx38.iad>
<tot03c$1gq8u$3@dont-email.me>
From: Rich...@Damon-Family.org (Richard Damon)
In-Reply-To: <tot03c$1gq8u$3@dont-email.me>
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 7bit
Lines: 17
Message-ID: <LAnsL.14833$ZhSc.9405@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: Sun, 1 Jan 2023 17:14:01 -0500
X-Received-Bytes: 2296
 by: Richard Damon - Sun, 1 Jan 2023 22:14 UTC

On 1/1/23 5:05 PM, olcott wrote:

> OK so you did not can cannot support your claim, thus your claim is
> rejected as baseless.
>

You can't either, so I guess we need to reject yours to.

You have already been shown to misunderstand other peoples work, so your
interpretation is unreliable.

You are even on the record of claiming to be "God" so your mental
stability is questionable.

You have destroyed your reputation and will be remembered, for at least
as long as you are remembered, as a lying crank that doesn't understand
the basics of what he was talking about.

Re: Tarski Undefinability Theorem is refuted

<fEnsL.14834$ZhSc.6990@fx38.iad>

  copy mid

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

  copy link   Newsgroups: comp.theory comp.ai.philosophy sci.logic
Path: i2pn2.org!i2pn.org!usenet.blueworldhosting.com!feed1.usenet.blueworldhosting.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.6.1
Subject: Re: Tarski Undefinability Theorem is refuted
Content-Language: en-US
Newsgroups: comp.theory,comp.ai.philosophy,sci.logic
References: <tokimd$c7q9$1@dont-email.me> <tokocm$ct3m$1@dont-email.me>
<gymrL.58668$SdR7.1356@fx04.iad> <toktee$ct3m$3@dont-email.me>
<p6nrL.24263$5S78.3335@fx48.iad> <ton062$mkig$1@dont-email.me>
<c8ErL.153012$gGD7.51143@fx11.iad> <ton3n7$msft$2@dont-email.me>
<9DFrL.108564$Tcw8.7605@fx10.iad> <tonqqm$plfv$1@dont-email.me>
<mZLrL.430121$GNG9.49737@fx18.iad> <toocgp$u29q$1@dont-email.me>
<LqPrL.59543$SdR7.255@fx04.iad> <topgct$11eou$2@dont-email.me>
<2DYrL.31899$4jN7.6964@fx02.iad> <topnro$12an3$1@dont-email.me>
<7EZrL.24698$b7Kc.23514@fx39.iad> <topqd9$12gbh$1@dont-email.me>
<Q%_rL.14622$ZhSc.13601@fx38.iad> <topvb5$12up5$1@dont-email.me>
<rL%rL.14722$ZhSc.3153@fx38.iad> <toq2ra$13eo3$1@dont-email.me>
<yH0sL.25579$Lfzc.19594@fx36.iad> <tosal9$1emtp$1@dont-email.me>
<o3ksL.30783$Olad.13377@fx35.iad> <toso7u$1g8qb$1@dont-email.me>
<G2nsL.14828$ZhSc.8210@fx38.iad> <tosus5$1gq8u$2@dont-email.me>
<imnsL.14831$ZhSc.6098@fx38.iad> <tot091$1gq8u$4@dont-email.me>
From: Rich...@Damon-Family.org (Richard Damon)
In-Reply-To: <tot091$1gq8u$4@dont-email.me>
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 7bit
Lines: 40
Message-ID: <fEnsL.14834$ZhSc.6990@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: Sun, 1 Jan 2023 17:17:45 -0500
X-Received-Bytes: 3287
 by: Richard Damon - Sun, 1 Jan 2023 22:17 UTC

On 1/1/23 5:08 PM, olcott wrote:
> On 1/1/2023 3:58 PM, Richard Damon wrote:
>> On 1/1/23 4:44 PM, olcott wrote:
>>> On 1/1/2023 3:37 PM, Richard Damon wrote:
>>>> On 1/1/23 2:51 PM, olcott wrote:
>>
>>>>>
>>>>> I claim that he does not understand this otherwise he would
>>>>> understand that the Liar Paradox is not a truth bearer and would
>>>>> have explicitly stated that: "the Liar Paradox is not a truth bearer".
>>>>
>>>> He knows that, that is why he points out that the fact that the
>>>> assumption of the existance of a Definition of Truth with the
>>>> system, the assumption of which allows him to prove (based on that
>>>> assumption) that the liar paradox is true, shows that it is
>>>> impossible for there to be a Defiition of Truth within the logic
>>>> system.
>>>>
>>>
>>> He never said anything like that.
>>>
>>
>> Yes, that is the whole basis of his proof.
>>
>> You just don't understand it because it seems you haven't actually
>> read his proof, just his sketch of the proof.
>
> Cite your sources. The proof that I cited is his entire proof in his own
> words not some Wikipedia summation.
>
> His proof was added as an afterthought to a paper that he had already
> published.
>

No, you cite SKETCHS of his proof presented in a book.

The sketch you cite isn't even in the actual form of a formal proof, but
a philosophical argument.

You are just showing you don't understand what you are talking about.

Re: Tarski Undefinability Theorem is refuted

<tot36d$1ha2q$1@dont-email.me>

  copy mid

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

  copy link   Newsgroups: comp.theory comp.ai.philosophy sci.logic
Path: i2pn2.org!i2pn.org!eternal-september.org!reader01.eternal-september.org!.POSTED!not-for-mail
From: polco...@gmail.com (olcott)
Newsgroups: comp.theory,comp.ai.philosophy,sci.logic
Subject: Re: Tarski Undefinability Theorem is refuted
Date: Sun, 1 Jan 2023 16:58:19 -0600
Organization: A noiseless patient Spider
Lines: 65
Message-ID: <tot36d$1ha2q$1@dont-email.me>
References: <tokimd$c7q9$1@dont-email.me> <gymrL.58668$SdR7.1356@fx04.iad>
<toktee$ct3m$3@dont-email.me> <p6nrL.24263$5S78.3335@fx48.iad>
<ton062$mkig$1@dont-email.me> <c8ErL.153012$gGD7.51143@fx11.iad>
<ton3n7$msft$2@dont-email.me> <9DFrL.108564$Tcw8.7605@fx10.iad>
<tonqqm$plfv$1@dont-email.me> <mZLrL.430121$GNG9.49737@fx18.iad>
<toocgp$u29q$1@dont-email.me> <LqPrL.59543$SdR7.255@fx04.iad>
<topgct$11eou$2@dont-email.me> <2DYrL.31899$4jN7.6964@fx02.iad>
<topnro$12an3$1@dont-email.me> <7EZrL.24698$b7Kc.23514@fx39.iad>
<topqd9$12gbh$1@dont-email.me> <Q%_rL.14622$ZhSc.13601@fx38.iad>
<topvb5$12up5$1@dont-email.me> <rL%rL.14722$ZhSc.3153@fx38.iad>
<toq2ra$13eo3$1@dont-email.me> <yH0sL.25579$Lfzc.19594@fx36.iad>
<tosal9$1emtp$1@dont-email.me> <o3ksL.30783$Olad.13377@fx35.iad>
<toso7u$1g8qb$1@dont-email.me> <G2nsL.14828$ZhSc.8210@fx38.iad>
<tosus5$1gq8u$2@dont-email.me> <imnsL.14831$ZhSc.6098@fx38.iad>
<tot091$1gq8u$4@dont-email.me> <fEnsL.14834$ZhSc.6990@fx38.iad>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 7bit
Injection-Date: Sun, 1 Jan 2023 22:58:21 -0000 (UTC)
Injection-Info: reader01.eternal-september.org; posting-host="ec74fc7ff5b29acdb9caf17777acae89";
logging-data="1615962"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1/bajNDYorI+xsfRzPzgRLW"
User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:102.0) Gecko/20100101
Thunderbird/102.6.1
Cancel-Lock: sha1:1w9jIcMYmSo8uH11kEvJqV4IHWE=
In-Reply-To: <fEnsL.14834$ZhSc.6990@fx38.iad>
Content-Language: en-US
 by: olcott - Sun, 1 Jan 2023 22:58 UTC

On 1/1/2023 4:17 PM, Richard Damon wrote:
> On 1/1/23 5:08 PM, olcott wrote:
>> On 1/1/2023 3:58 PM, Richard Damon wrote:
>>> On 1/1/23 4:44 PM, olcott wrote:
>>>> On 1/1/2023 3:37 PM, Richard Damon wrote:
>>>>> On 1/1/23 2:51 PM, olcott wrote:
>>>
>>>>>>
>>>>>> I claim that he does not understand this otherwise he would
>>>>>> understand that the Liar Paradox is not a truth bearer and would
>>>>>> have explicitly stated that: "the Liar Paradox is not a truth
>>>>>> bearer".
>>>>>
>>>>> He knows that, that is why he points out that the fact that the
>>>>> assumption of the existance of a Definition of Truth with the
>>>>> system, the assumption of which allows him to prove (based on that
>>>>> assumption) that the liar paradox is true, shows that it is
>>>>> impossible for there to be a Defiition of Truth within the logic
>>>>> system.
>>>>>
>>>>
>>>> He never said anything like that.
>>>>
>>>
>>> Yes, that is the whole basis of his proof.
>>>
>>> You just don't understand it because it seems you haven't actually
>>> read his proof, just his sketch of the proof.
>>
>> Cite your sources. The proof that I cited is his entire proof in his
>> own words not some Wikipedia summation.
>>
>> His proof was added as an afterthought to a paper that he had already
>> published.
>>
>
> No, you cite SKETCHS of his proof presented in a book.
>
> The sketch you cite isn't even in the actual form of a formal proof, but
> a philosophical argument.
>
> You are just showing you don't understand what you are talking about.

It took me a few years to find his proof. It is contained in an 11 page
postscript to his 127 page paper: "The concept of truth in formalized
languages". There is nothing like a proof in these 11 pages besides the
two pages that I linked. *All sources refer to his proof in this paper*

Here is the whole paper, the proof is still on pages 275-276:
http://www.thatmarcusfamily.org/philosophy/Course_Websites/Readings/Tarski%20-%20The%20Concept%20of%20Truth%20in%20Formalized%20Languages.pdf

This same link is referenced by this source:
https://en.wikipedia.org/wiki/Tarski%27s_undefinability_theorem

in this reference:
A. Tarski, tr. J. H. Woodger, 1983. "The Concept of Truth in Formalized
Languages". English translation of Tarski's 1936 article. In A. Tarski,
ed. J. Corcoran, 1983, Logic, Semantics, Metamathematics, Hackett.

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

Re: Tarski Undefinability Theorem is refuted

<totajk$1hqog$2@dont-email.me>

  copy mid

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

  copy link   Newsgroups: comp.theory comp.ai.philosophy sci.logic
Path: i2pn2.org!i2pn.org!eternal-september.org!reader01.eternal-september.org!.POSTED!not-for-mail
From: polco...@gmail.com (olcott)
Newsgroups: comp.theory,comp.ai.philosophy,sci.logic
Subject: Re: Tarski Undefinability Theorem is refuted
Date: Sun, 1 Jan 2023 19:04:52 -0600
Organization: A noiseless patient Spider
Lines: 231
Message-ID: <totajk$1hqog$2@dont-email.me>
References: <tokimd$c7q9$1@dont-email.me> <Y4lrL.204366$8_id.12194@fx09.iad>
<tokocm$ct3m$1@dont-email.me> <gymrL.58668$SdR7.1356@fx04.iad>
<toktee$ct3m$3@dont-email.me> <p6nrL.24263$5S78.3335@fx48.iad>
<ton062$mkig$1@dont-email.me> <c8ErL.153012$gGD7.51143@fx11.iad>
<ton3n7$msft$2@dont-email.me> <9DFrL.108564$Tcw8.7605@fx10.iad>
<tonqqm$plfv$1@dont-email.me> <mZLrL.430121$GNG9.49737@fx18.iad>
<toocgp$u29q$1@dont-email.me> <LqPrL.59543$SdR7.255@fx04.iad>
<topgct$11eou$2@dont-email.me> <2DYrL.31899$4jN7.6964@fx02.iad>
<topnro$12an3$1@dont-email.me> <7EZrL.24698$b7Kc.23514@fx39.iad>
<topqd9$12gbh$1@dont-email.me> <Q%_rL.14622$ZhSc.13601@fx38.iad>
<topvb5$12up5$1@dont-email.me> <rL%rL.14722$ZhSc.3153@fx38.iad>
<toq2ra$13eo3$1@dont-email.me> <yH0sL.25579$Lfzc.19594@fx36.iad>
<tosal9$1emtp$1@dont-email.me> <o3ksL.30783$Olad.13377@fx35.iad>
<toso7u$1g8qb$1@dont-email.me> <G2nsL.14828$ZhSc.8210@fx38.iad>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Mon, 2 Jan 2023 01:04:52 -0000 (UTC)
Injection-Info: reader01.eternal-september.org; posting-host="aedfdee08f235ae0f6fbedbc56fd7c48";
logging-data="1633040"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1/efErjR+72vitwyi9X8WAp"
User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:102.0) Gecko/20100101
Thunderbird/102.6.1
Cancel-Lock: sha1:oBwoRkey2zuOoZaPRihrGip/xlM=
In-Reply-To: <G2nsL.14828$ZhSc.8210@fx38.iad>
Content-Language: en-US
 by: olcott - Mon, 2 Jan 2023 01:04 UTC

On 1/1/2023 3:37 PM, Richard Damon wrote:
> On 1/1/23 2:51 PM, olcott wrote:
>> On 1/1/2023 12:13 PM, Richard Damon wrote:
>>> On 1/1/23 10:59 AM, olcott wrote:
>>>> On 12/31/2022 2:11 PM, Richard Damon wrote:
>>>>> On 12/31/22 2:34 PM, olcott wrote:
>>>>>> On 12/31/2022 1:07 PM, Richard Damon wrote:
>>>>>>> On 12/31/22 1:34 PM, olcott wrote:
>>>>>>>> On 12/31/2022 12:16 PM, Richard Damon wrote:
>>>>>>>>> On 12/31/22 12:10 PM, olcott wrote:
>>>>>>>>>
>>>>>>>>>> This sentence is not true.
>>>>>>>>>> is not true because it is self-contradictory.
>>>>>>>>>
>>>>>>>>> Right, and thus there can not be a Definition of Truth in the
>>>>>>>>> system because if there was, you could show that statement True.
>>>>>>>>
>>>>>>>> 這句話不是真的: "This sentence is not true."
>>>>>>>> The Chinese says "This sentence is not true:" referring to the
>>>>>>>> English.
>>>>>>>>
>>>>>>>> The Chinese sentence is true because the English sentence is
>>>>>>>> self-contradictory. This is an exact isomorphism to:
>>>>>>>>
>>>>>>>>    "sentence x which is undecidable in the original theory [my
>>>>>>>> English]
>>>>>>>>     becomes a decidable sentence in the enriched theory [my
>>>>>>>> Chinese]."
>>>>>>>>
>>>>>>>
>>>>>>> Which is a non-sequitor, showing you don't understand what you
>>>>>>> are talking about.
>>>>>>>
>>>>>>> You are just proving your Stupidity.
>>>>>>>
>>>>>>> I don't think you even actually understand any of the basics of
>>>>>>> logic.
>>>>>>>
>>>>>>> You can parrot words, but you show an utter lack of knowledge
>>>>>>> about how any of it works.
>>>>>>
>>>>>> Try and paraphrase 100% perfectly exactly what you think that
>>>>>> Tarski is
>>>>>> saying. Any idiot (even a bot) can claim that someone is wrong.
>>>>>
>>>>> **Like you are doing**
>>>>>
>>>>>>
>>>>>> It takes actual understanding to point out the exact error and the
>>>>>> reason that it is an error.
>>>>>>
>>>>>>
>>>>>
>>>>> Why do we need to paraphrase?
>>>>>
>>>>> He says that a "Definition" of Truth, by which he means a way to
>>>>> determine if a given arbitrary sentence expressed in the Theory is
>>>>> True or False (or not a Truth Bearer) because, if such a definition
>>>>> existed, then from that definition you could prove in the defined
>>>>> Meta-Theory that a Statement like the Liar's Paradox was actually
>>>>> True.
>>>>>
>>>>
>>>> No that is incorrect. Tarski never indicated that he understood that
>>>> expressions of formal language are not necessarily truth bearers.
>>>
>>>
>>> Can yo PROVE that tement, have you read EVERYTHING he has written.
>>>
>>
>> You made a claim that he understood this thus it is up to you to cite
>> your reference.
>
> I did.
>
>>
>> I claim that he does not understand this otherwise he would understand
>> that the Liar Paradox is not a truth bearer and would have explicitly
>> stated that: "the Liar Paradox is not a truth bearer".
>
> He knows that, that is why he points out that the fact that the
> assumption of the existance of a Definition of Truth with the system,
> the assumption of which allows him to prove (based on that assumption)
> that the liar paradox is true, shows that it is impossible for there to
> be a Defiition of Truth within the logic system.
>
> What don't YOU understand about that statement?
>
>>
>>> He actually seems to understand this, because he uses the fact that
>>> "proving" the Liar's Paradox, based on an assumed Thesis, shows the
>>> assumed Thesis must be false.
>>
>> The way that Tarski said it: "This sentence is not true" is undecidable
>> in his theory and true in his meta-theory.
>
> BASED ON THE ASSUMPTION OF THESIS A.
>
> Thus, THESIS A can't be true.
>
>>
>> He never realized that what he really meant is that this sentence is
>> not true in his theory: "This sentence is not true"
>>
>> and this sentence is true in his meta-theory:
>> {This sentence is not true: "This sentence is not true"}
>
> Nope, that ISN'T what he is talking about. You just are not
> understanding his words.
>
> You have shown enough misundetandings, the most like cause of any
> disagreement between you and a respected logictian is that you don't
> actually understand what he is saying.
>
> This is also a natural outcome of your MISAPPLICATION of the concept of
> "First Principles".
>
>>
>>>>
>>>> This sentence is true:
>>>> {The following sentence is not true: "This sentence is not true."}
>>>>
>>>>
>>>>> Thus, since we know that can't be,
>>>>
>>>> Try and think of any expression of language that is true entirely on
>>>> the
>>>> basis of its meaning that does not have truthmaker connections to these
>>>> semantic meanings.
>>>
>>> No one is arguing that.
>>
>> Hardly anyone seems to understand that the Liar Paradox is simply not a
>> truth bearer otherwise tertiary logic would have never been created.
>
> No Nearly EVERYONE understands that in Binary Logic, the Liar Paracos is
> simply not a Truth Bearer.
>
> Things like tertiary Logic are attempts to expand the logic system to
> see if a system of logic could handle it.
>
> You DO understand the concepts of differing systems of logic with
> different ground rules, don't you?
>
> Maybe you don't as that concept breaks you idea of an overarching
> Meta-system that all logic falls under.
>
>>
>> Every logic system only has expressions of language that are {true,
>> false} or are not members of this formal system.
>
> Note members of THIS group of formal systems.
>
> Other formal systems have other values in their logic.
>
>>
>>>>
>>>> If no such counter example exists in the universe then that proves that
>>>> I am correct about the requirement of semantic connections to truth
>>>> makers.
>>>
>>> Right, but that doesn't make it PROVABLE by the definition of Provable.
>>>
>>
>> Every element of the set of analytic knowledge is provable and the
>> remaining elements of the set of analytic truth have unknown truth
>> values.
>
> Yes, KNOWLEDGE is Provavle.
>
> TRUTH is not necessarily, as it may have an infinite set of connections,
> which makes it outside the normal definition of Knowable.
>
>>
>>>>
>>>> Self-contradictory expressions of language have no truthmaker
>>>> semantic connections.
>>>>
>>>> This also applies to expressions of language that have vacuous truth
>>>> objects: "This sentence is true"
>>>>
>>>> True about what?
>>>> True about being true.
>>>> True about being true about what?
>>>> True about being true about being true.
>>>>
>>>> Ah I see an infinitely recursive structure that never is never resolved
>>>> to a truth value, thus not a truth bearer.
>>>
>>>
>>>
>>>>
>>>>> there must not be an ability to define in a system of logic, a
>>>>> "Definition of Truth" that allows you to determine (i.e. Proof)
>>>>> every True Statement, Disprove every false statement, and determine
>>>>> that every non-truthbearer was a non-truthbearer.
>>>>>
>>>>
>>>> The possible requirement of an infinite proof requires that some
>>>> expressions of language can only have an unknown Boolean value.
>>>> We can't even tell that they definitely require an infinite proof.
>>>
>>> Right, its value is unknown in that Thoery, and thus unprovable in
>>> that theory. A Meta-Theory may be able to show that it actually IS
>>> true in that theory, and thus we have in the Theory a statment that
>>> actually is True (but not KNOWN to be true in the Theory) that is
>>> unprovable.
>>>
>>
>> The correct "theory" of the set of analytic truth allows any order of
>> reference from 0th order logic no N-ary logic.
>>
>> As Wittgenstein said true in a formal system means has been proved in
>> this formal system and false in this formal system means that the
>> opposite has been proved in this formal system.
>
> And he is WRONG in that statement,


Click here to read the complete article
Re: Tarski Undefinability Theorem is refuted

<totbjh$1hqog$4@dont-email.me>

  copy mid

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

  copy link   Newsgroups: comp.theory comp.ai.philosophy sci.logic
Path: i2pn2.org!i2pn.org!eternal-september.org!reader01.eternal-september.org!.POSTED!not-for-mail
From: polco...@gmail.com (olcott)
Newsgroups: comp.theory,comp.ai.philosophy,sci.logic
Subject: Re: Tarski Undefinability Theorem is refuted
Date: Sun, 1 Jan 2023 19:21:53 -0600
Organization: A noiseless patient Spider
Lines: 134
Message-ID: <totbjh$1hqog$4@dont-email.me>
References: <tokimd$c7q9$1@dont-email.me> <Y4lrL.204366$8_id.12194@fx09.iad>
<tokocm$ct3m$1@dont-email.me> <gymrL.58668$SdR7.1356@fx04.iad>
<toktee$ct3m$3@dont-email.me> <p6nrL.24263$5S78.3335@fx48.iad>
<ton062$mkig$1@dont-email.me> <c8ErL.153012$gGD7.51143@fx11.iad>
<ton3n7$msft$2@dont-email.me> <9DFrL.108564$Tcw8.7605@fx10.iad>
<tonqqm$plfv$1@dont-email.me> <mZLrL.430121$GNG9.49737@fx18.iad>
<toocgp$u29q$1@dont-email.me> <LqPrL.59543$SdR7.255@fx04.iad>
<topgct$11eou$2@dont-email.me> <2DYrL.31899$4jN7.6964@fx02.iad>
<topnro$12an3$1@dont-email.me> <7EZrL.24698$b7Kc.23514@fx39.iad>
<topqd9$12gbh$1@dont-email.me> <Q%_rL.14622$ZhSc.13601@fx38.iad>
<topvb5$12up5$1@dont-email.me> <rL%rL.14722$ZhSc.3153@fx38.iad>
<toq2ra$13eo3$1@dont-email.me> <yH0sL.25579$Lfzc.19594@fx36.iad>
<toq5r8$13kvn$1@dont-email.me> <9C1sL.246623$9sn9.233359@fx17.iad>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Mon, 2 Jan 2023 01:21:53 -0000 (UTC)
Injection-Info: reader01.eternal-september.org; posting-host="aedfdee08f235ae0f6fbedbc56fd7c48";
logging-data="1633040"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1+CmbgSwaF7VEjqiWfGSXO5"
User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:102.0) Gecko/20100101
Thunderbird/102.6.1
Cancel-Lock: sha1:B6fAEWSrpHmyoshQ/UqIzBhI0xc=
In-Reply-To: <9C1sL.246623$9sn9.233359@fx17.iad>
Content-Language: en-US
 by: olcott - Mon, 2 Jan 2023 01:21 UTC

On 12/31/2022 3:13 PM, Richard Damon wrote:
> On 12/31/22 3:25 PM, olcott wrote:
>> On 12/31/2022 2:11 PM, Richard Damon wrote:
>>> On 12/31/22 2:34 PM, olcott wrote:
>>>> On 12/31/2022 1:07 PM, Richard Damon wrote:
>>>>> On 12/31/22 1:34 PM, olcott wrote:
>>>>>> On 12/31/2022 12:16 PM, Richard Damon wrote:
>>>>>>> On 12/31/22 12:10 PM, olcott wrote:
>>>>>>>
>>>>>>>> This sentence is not true.
>>>>>>>> is not true because it is self-contradictory.
>>>>>>>
>>>>>>> Right, and thus there can not be a Definition of Truth in the
>>>>>>> system because if there was, you could show that statement True.
>>>>>>
>>>>>> 這句話不是真的: "This sentence is not true."
>>>>>> The Chinese says "This sentence is not true:" referring to the
>>>>>> English.
>>>>>>
>>>>>> The Chinese sentence is true because the English sentence is
>>>>>> self-contradictory. This is an exact isomorphism to:
>>>>>>
>>>>>>    "sentence x which is undecidable in the original theory [my
>>>>>> English]
>>>>>>     becomes a decidable sentence in the enriched theory [my
>>>>>> Chinese]."
>>>>>>
>>>>>
>>>>> Which is a non-sequitor, showing you don't understand what you are
>>>>> talking about.
>>>>>
>>>>> You are just proving your Stupidity.
>>>>>
>>>>> I don't think you even actually understand any of the basics of logic.
>>>>>
>>>>> You can parrot words, but you show an utter lack of knowledge about
>>>>> how any of it works.
>>>>
>>>> Try and paraphrase 100% perfectly exactly what you think that Tarski is
>>>> saying. Any idiot (even a bot) can claim that someone is wrong.
>>>
>>> **Like you are doing**
>>>
>>>>
>>>> It takes actual understanding to point out the exact error and the
>>>> reason that it is an error.
>>>>
>>>>
>>>
>>> Why do we need to paraphrase?
>>>
>>> He says that a "Definition" of Truth, by which he means a way to
>>> determine if a given arbitrary sentence expressed in the Theory is
>>> True or False (or not a Truth Bearer) because, if such a definition
>>> existed, then from that definition you could prove in the defined
>>> Meta-Theory that a Statement like the Liar's Paradox was actually True.
>>
>>
>> https://liarparadox.org/Tarski_275_276.pdf
>> That is not what he is saying, try again.
>
> Like you just said, even an idiot can just claim something is wrong.
>
> Note, since you aren't even showing the full chapter (which likely would
> be a copyright violation) its hard to get the full context of his
> statements, but thesse pages are
>
>>
>>>
>>> Thus, since we know that can't be, there must not be an ability to
>>> define in a system of logic, a "Definition of Truth" that allows you
>>> to determine (i.e. Proof) every True Statement, Disprove every false
>>> statement, and determine that every non-truthbearer was a
>>> non-truthbearer.
>>>
>>>
>>> What else do you think he is saying?
>>
>>    "sentence x which is undecidable in the original theory
>>     becomes a decidable sentence in the enriched theory"
>>
>>
>
> ACCORDING TO THESIS A, this isn't neccesarily true if Thesis A isn't
> True. In fact, I suspect this whole section is building up to showing
> this leads to a contradiction, and thus THESIS A isn't True.
>
> Remeber, at the end he says:
>
> I should like to draw attention here to an analogous result. For every
> deductive science in "Which arithmetic is contained it is possible to
> specify arithmetical notions which, so to speak, belong intuitively to
> this science, but ,vhich cannot be defined on the basis of this science.
> 'Vith the help of methods which are, completely analogous to those used
> in the copstruction of the definition of truth, it is nevertheless
> possible to show that these concepts can be so defined provided the
> science is enriched by the introduction of variables of higher order.
>
>
> Which points out that IN THE THEORY, there are things which can not be
> defined, but need to be expressed in a higher order Theory (the Meta
> Theory)
>
> By extension, there will be things in the Meta-Theory which can not be
> defined, but need to be expressed in an even HIGHER order Theory (a
> Meta-Meta-Theory) and so on.
>

Or we could simply begin with 0 to N order logic and express any
analytic truth what-so-ever.

"This sentence is not true" is at one order of logic and untrue.

This sentence is not true: "This sentence is not true" is at one
increment of higher order referring to the original order.

> Thus in any Theory, or Meta^n Theory, there will ALWAYS be things that
> can not be defined.
>

A finite order of logic can correctly specify any finite truth.
Most (if not all) infinite truths can be algorithmically compressed into
some finite logic.

> You don't seem to understand how proof by contradiction works, because
> you mind is too simple.

Right and you are one of the 16 people in the world with a six sigma IQ.
For an MIT grad I don't see the thrill in telling outrageous lies.

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

Re: Tarski Undefinability Theorem is refuted

<totc11$1hqog$6@dont-email.me>

  copy mid

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

  copy link   Newsgroups: comp.theory comp.ai.philosophy sci.logic
Path: i2pn2.org!i2pn.org!eternal-september.org!reader01.eternal-september.org!.POSTED!not-for-mail
From: polco...@gmail.com (olcott)
Newsgroups: comp.theory,comp.ai.philosophy,sci.logic
Subject: Re: Tarski Undefinability Theorem is refuted
Date: Sun, 1 Jan 2023 19:29:05 -0600
Organization: A noiseless patient Spider
Lines: 149
Message-ID: <totc11$1hqog$6@dont-email.me>
References: <tokimd$c7q9$1@dont-email.me> <Y4lrL.204366$8_id.12194@fx09.iad>
<tokocm$ct3m$1@dont-email.me> <gymrL.58668$SdR7.1356@fx04.iad>
<toktee$ct3m$3@dont-email.me> <p6nrL.24263$5S78.3335@fx48.iad>
<ton062$mkig$1@dont-email.me> <c8ErL.153012$gGD7.51143@fx11.iad>
<ton3n7$msft$2@dont-email.me> <9DFrL.108564$Tcw8.7605@fx10.iad>
<tonqqm$plfv$1@dont-email.me> <mZLrL.430121$GNG9.49737@fx18.iad>
<toocgp$u29q$1@dont-email.me> <LqPrL.59543$SdR7.255@fx04.iad>
<topgct$11eou$2@dont-email.me> <2DYrL.31899$4jN7.6964@fx02.iad>
<topnro$12an3$1@dont-email.me> <7EZrL.24698$b7Kc.23514@fx39.iad>
<topqd9$12gbh$1@dont-email.me> <Q%_rL.14622$ZhSc.13601@fx38.iad>
<topvb5$12up5$1@dont-email.me> <rL%rL.14722$ZhSc.3153@fx38.iad>
<toq2ra$13eo3$1@dont-email.me> <yH0sL.25579$Lfzc.19594@fx36.iad>
<tosal9$1emtp$1@dont-email.me> <o3ksL.30783$Olad.13377@fx35.iad>
<toso7u$1g8qb$1@dont-email.me> <G2nsL.14828$ZhSc.8210@fx38.iad>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Mon, 2 Jan 2023 01:29:05 -0000 (UTC)
Injection-Info: reader01.eternal-september.org; posting-host="aedfdee08f235ae0f6fbedbc56fd7c48";
logging-data="1633040"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1/zbFaYe93bFUnhqxK+YE7i"
User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:102.0) Gecko/20100101
Thunderbird/102.6.1
Cancel-Lock: sha1:7Z+mjXFpDY/qGuCbNxEd4VdaVrU=
In-Reply-To: <G2nsL.14828$ZhSc.8210@fx38.iad>
Content-Language: en-US
 by: olcott - Mon, 2 Jan 2023 01:29 UTC

On 1/1/2023 3:37 PM, Richard Damon wrote:
> On 1/1/23 2:51 PM, olcott wrote:
>> On 1/1/2023 12:13 PM, Richard Damon wrote:
>>> On 1/1/23 10:59 AM, olcott wrote:
>>>> On 12/31/2022 2:11 PM, Richard Damon wrote:
>>>>> On 12/31/22 2:34 PM, olcott wrote:
>>>>>> On 12/31/2022 1:07 PM, Richard Damon wrote:
>>>>>>> On 12/31/22 1:34 PM, olcott wrote:
>>>>>>>> On 12/31/2022 12:16 PM, Richard Damon wrote:
>>>>>>>>> On 12/31/22 12:10 PM, olcott wrote:
>>>>>>>>>
>>>>>>>>>> This sentence is not true.
>>>>>>>>>> is not true because it is self-contradictory.
>>>>>>>>>
>>>>>>>>> Right, and thus there can not be a Definition of Truth in the
>>>>>>>>> system because if there was, you could show that statement True.
>>>>>>>>
>>>>>>>> 這句話不是真的: "This sentence is not true."
>>>>>>>> The Chinese says "This sentence is not true:" referring to the
>>>>>>>> English.
>>>>>>>>
>>>>>>>> The Chinese sentence is true because the English sentence is
>>>>>>>> self-contradictory. This is an exact isomorphism to:
>>>>>>>>
>>>>>>>>    "sentence x which is undecidable in the original theory [my
>>>>>>>> English]
>>>>>>>>     becomes a decidable sentence in the enriched theory [my
>>>>>>>> Chinese]."
>>>>>>>>
>>>>>>>
>>>>>>> Which is a non-sequitor, showing you don't understand what you
>>>>>>> are talking about.
>>>>>>>
>>>>>>> You are just proving your Stupidity.
>>>>>>>
>>>>>>> I don't think you even actually understand any of the basics of
>>>>>>> logic.
>>>>>>>
>>>>>>> You can parrot words, but you show an utter lack of knowledge
>>>>>>> about how any of it works.
>>>>>>
>>>>>> Try and paraphrase 100% perfectly exactly what you think that
>>>>>> Tarski is
>>>>>> saying. Any idiot (even a bot) can claim that someone is wrong.
>>>>>
>>>>> **Like you are doing**
>>>>>
>>>>>>
>>>>>> It takes actual understanding to point out the exact error and the
>>>>>> reason that it is an error.
>>>>>>
>>>>>>
>>>>>
>>>>> Why do we need to paraphrase?
>>>>>
>>>>> He says that a "Definition" of Truth, by which he means a way to
>>>>> determine if a given arbitrary sentence expressed in the Theory is
>>>>> True or False (or not a Truth Bearer) because, if such a definition
>>>>> existed, then from that definition you could prove in the defined
>>>>> Meta-Theory that a Statement like the Liar's Paradox was actually
>>>>> True.
>>>>>
>>>>
>>>> No that is incorrect. Tarski never indicated that he understood that
>>>> expressions of formal language are not necessarily truth bearers.
>>>
>>>
>>> Can yo PROVE that tement, have you read EVERYTHING he has written.
>>>
>>
>> You made a claim that he understood this thus it is up to you to cite
>> your reference.
>
> I did.
>
>>
>> I claim that he does not understand this otherwise he would understand
>> that the Liar Paradox is not a truth bearer and would have explicitly
>> stated that: "the Liar Paradox is not a truth bearer".
>
> He knows that, that is why he points out that the fact that the
> assumption of the existance of a Definition of Truth with the system,
> the assumption of which allows him to prove (based on that assumption)
> that the liar paradox is true, shows that it is impossible for there to
> be a Defiition of Truth within the logic system.
>
> What don't YOU understand about that statement?
>
>>
>>> He actually seems to understand this, because he uses the fact that
>>> "proving" the Liar's Paradox, based on an assumed Thesis, shows the
>>> assumed Thesis must be false.
>>
>> The way that Tarski said it: "This sentence is not true" is undecidable
>> in his theory and true in his meta-theory.
>
> BASED ON THE ASSUMPTION OF THESIS A.
>
> Thus, THESIS A can't be true.
>
>>
>> He never realized that what he really meant is that this sentence is
>> not true in his theory: "This sentence is not true"
>>
>> and this sentence is true in his meta-theory:
>> {This sentence is not true: "This sentence is not true"}
>
> Nope, that ISN'T what he is talking about. You just are not
> understanding his words.
>
> You have shown enough misundetandings, the most like cause of any
> disagreement between you and a respected logictian is that you don't
> actually understand what he is saying.
>
> This is also a natural outcome of your MISAPPLICATION of the concept of
> "First Principles".
>
>>
>>>>
>>>> This sentence is true:
>>>> {The following sentence is not true: "This sentence is not true."}
>>>>
>>>>
>>>>> Thus, since we know that can't be,
>>>>
>>>> Try and think of any expression of language that is true entirely on
>>>> the
>>>> basis of its meaning that does not have truthmaker connections to these
>>>> semantic meanings.
>>>
>>> No one is arguing that.
>>
>> Hardly anyone seems to understand that the Liar Paradox is simply not a
>> truth bearer otherwise tertiary logic would have never been created.
>
> No Nearly EVERYONE understands that in Binary Logic, the Liar Paracos is
> simply not a Truth Bearer.

I don't think that all the people writing papers about how to resolve
the Liar Paradox fail to understand binary logic.

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

Re: Tarski Undefinability Theorem is refuted

<hdrsL.27463$cKvc.22029@fx42.iad>

  copy mid

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

  copy link   Newsgroups: comp.theory comp.ai.philosophy sci.logic
Path: i2pn2.org!i2pn.org!usenet.blueworldhosting.com!feed1.usenet.blueworldhosting.com!peer03.iad!feed-me.highwinds-media.com!news.highwinds-media.com!fx42.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.6.1
Subject: Re: Tarski Undefinability Theorem is refuted
Content-Language: en-US
Newsgroups: comp.theory,comp.ai.philosophy,sci.logic
References: <tokimd$c7q9$1@dont-email.me> <Y4lrL.204366$8_id.12194@fx09.iad>
<tokocm$ct3m$1@dont-email.me> <gymrL.58668$SdR7.1356@fx04.iad>
<toktee$ct3m$3@dont-email.me> <p6nrL.24263$5S78.3335@fx48.iad>
<ton062$mkig$1@dont-email.me> <c8ErL.153012$gGD7.51143@fx11.iad>
<ton3n7$msft$2@dont-email.me> <9DFrL.108564$Tcw8.7605@fx10.iad>
<tonqqm$plfv$1@dont-email.me> <mZLrL.430121$GNG9.49737@fx18.iad>
<toocgp$u29q$1@dont-email.me> <LqPrL.59543$SdR7.255@fx04.iad>
<topgct$11eou$2@dont-email.me> <2DYrL.31899$4jN7.6964@fx02.iad>
<topnro$12an3$1@dont-email.me> <7EZrL.24698$b7Kc.23514@fx39.iad>
<topqd9$12gbh$1@dont-email.me> <Q%_rL.14622$ZhSc.13601@fx38.iad>
<topvb5$12up5$1@dont-email.me> <rL%rL.14722$ZhSc.3153@fx38.iad>
<toq2ra$13eo3$1@dont-email.me> <yH0sL.25579$Lfzc.19594@fx36.iad>
<toq5r8$13kvn$1@dont-email.me> <9C1sL.246623$9sn9.233359@fx17.iad>
<totbjh$1hqog$4@dont-email.me>
From: Rich...@Damon-Family.org (Richard Damon)
In-Reply-To: <totbjh$1hqog$4@dont-email.me>
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Lines: 161
Message-ID: <hdrsL.27463$cKvc.22029@fx42.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: Sun, 1 Jan 2023 21:22:03 -0500
X-Received-Bytes: 8018
 by: Richard Damon - Mon, 2 Jan 2023 02:22 UTC

On 1/1/23 8:21 PM, olcott wrote:
> On 12/31/2022 3:13 PM, Richard Damon wrote:
>> On 12/31/22 3:25 PM, olcott wrote:
>>> On 12/31/2022 2:11 PM, Richard Damon wrote:
>>>> On 12/31/22 2:34 PM, olcott wrote:
>>>>> On 12/31/2022 1:07 PM, Richard Damon wrote:
>>>>>> On 12/31/22 1:34 PM, olcott wrote:
>>>>>>> On 12/31/2022 12:16 PM, Richard Damon wrote:
>>>>>>>> On 12/31/22 12:10 PM, olcott wrote:
>>>>>>>>
>>>>>>>>> This sentence is not true.
>>>>>>>>> is not true because it is self-contradictory.
>>>>>>>>
>>>>>>>> Right, and thus there can not be a Definition of Truth in the
>>>>>>>> system because if there was, you could show that statement True.
>>>>>>>
>>>>>>> 這句話不是真的: "This sentence is not true."
>>>>>>> The Chinese says "This sentence is not true:" referring to the
>>>>>>> English.
>>>>>>>
>>>>>>> The Chinese sentence is true because the English sentence is
>>>>>>> self-contradictory. This is an exact isomorphism to:
>>>>>>>
>>>>>>>    "sentence x which is undecidable in the original theory [my
>>>>>>> English]
>>>>>>>     becomes a decidable sentence in the enriched theory [my
>>>>>>> Chinese]."
>>>>>>>
>>>>>>
>>>>>> Which is a non-sequitor, showing you don't understand what you are
>>>>>> talking about.
>>>>>>
>>>>>> You are just proving your Stupidity.
>>>>>>
>>>>>> I don't think you even actually understand any of the basics of
>>>>>> logic.
>>>>>>
>>>>>> You can parrot words, but you show an utter lack of knowledge
>>>>>> about how any of it works.
>>>>>
>>>>> Try and paraphrase 100% perfectly exactly what you think that
>>>>> Tarski is
>>>>> saying. Any idiot (even a bot) can claim that someone is wrong.
>>>>
>>>> **Like you are doing**
>>>>
>>>>>
>>>>> It takes actual understanding to point out the exact error and the
>>>>> reason that it is an error.
>>>>>
>>>>>
>>>>
>>>> Why do we need to paraphrase?
>>>>
>>>> He says that a "Definition" of Truth, by which he means a way to
>>>> determine if a given arbitrary sentence expressed in the Theory is
>>>> True or False (or not a Truth Bearer) because, if such a definition
>>>> existed, then from that definition you could prove in the defined
>>>> Meta-Theory that a Statement like the Liar's Paradox was actually True.
>>>
>>>
>>> https://liarparadox.org/Tarski_275_276.pdf
>>> That is not what he is saying, try again.
>>
>> Like you just said, even an idiot can just claim something is wrong.
>>
>> Note, since you aren't even showing the full chapter (which likely
>> would be a copyright violation) its hard to get the full context of
>> his statements, but thesse pages are
>>
>>>
>>>>
>>>> Thus, since we know that can't be, there must not be an ability to
>>>> define in a system of logic, a "Definition of Truth" that allows you
>>>> to determine (i.e. Proof) every True Statement, Disprove every false
>>>> statement, and determine that every non-truthbearer was a
>>>> non-truthbearer.
>>>>
>>>>
>>>> What else do you think he is saying?
>>>
>>>    "sentence x which is undecidable in the original theory
>>>     becomes a decidable sentence in the enriched theory"
>>>
>>>
>>
>> ACCORDING TO THESIS A, this isn't neccesarily true if Thesis A isn't
>> True. In fact, I suspect this whole section is building up to showing
>> this leads to a contradiction, and thus THESIS A isn't True.
>>
>> Remeber, at the end he says:
>>
>> I should like to draw attention here to an analogous result. For every
>> deductive science in "Which arithmetic is contained it is possible to
>> specify arithmetical notions which, so to speak, belong intuitively to
>> this science, but ,vhich cannot be defined on the basis of this
>> science. 'Vith the help of methods which are, completely analogous to
>> those used in the copstruction of the definition of truth, it is
>> nevertheless possible to show that these concepts can be so defined
>> provided the science is enriched by the introduction of variables of
>> higher order.
>>
>>
>> Which points out that IN THE THEORY, there are things which can not be
>> defined, but need to be expressed in a higher order Theory (the Meta
>> Theory)
>>
>> By extension, there will be things in the Meta-Theory which can not be
>> defined, but need to be expressed in an even HIGHER order Theory (a
>> Meta-Meta-Theory) and so on.
>>
>
> Or we could simply begin with 0 to N order logic and express any
> analytic truth what-so-ever.
>

Until you get to an expression that needs N+1 order logic.

> "This sentence is not true" is at one order of logic and untrue.
>
> This sentence is not true: "This sentence is not true" is at one
> increment of higher order referring to the original order.
>
>> Thus in any Theory, or Meta^n Theory, there will ALWAYS be things that
>> can not be defined.
>>
>
> A finite order of logic can correctly specify any finite truth.
> Most (if not all) infinite truths can be algorithmically compressed into
> some finite logic.

What is a "finite Truth", one that needs only a finite number of steps
to get to it, you mean a PROBALBE truth?

Why do you say that "Most" infinite truths can be algoritmically
commpressed? What evidence do you have of that,

And if ANY of them can't, it says you have an unprovable truth.

>
>> You don't seem to understand how proof by contradiction works, because
>> you mind is too simple.
>
> Right and you are one of the 16 people in the world with a six sigma IQ.
> For an MIT grad I don't see the thrill in telling outrageous lies.
>

Actually, it more shows how little you should believe in single fixed
tests. I will admit that I probably topped out the test and it wasn't
properly calibrated at the high end, but that is the result it gave.

Another test gave me a 150, and the tester admitted that that was as
high as the test would go, and I was likely much higher, but that was
more than high enough for what I was testing for.

I put little enough faith it IQ tests that I haven't bothered trying a
test really designed for top end people, because in my mind it doesn't
really matter, because intelegence isn't a one dimensional thing that
can be accurately measured.

Re: Tarski Undefinability Theorem is refuted

<VmrsL.27464$cKvc.6795@fx42.iad>

  copy mid

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

  copy link   Newsgroups: comp.theory comp.ai.philosophy sci.logic
Path: i2pn2.org!i2pn.org!usenet.blueworldhosting.com!feed1.usenet.blueworldhosting.com!peer01.iad!feed-me.highwinds-media.com!news.highwinds-media.com!fx42.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.6.1
Subject: Re: Tarski Undefinability Theorem is refuted
Content-Language: en-US
Newsgroups: comp.theory,comp.ai.philosophy,sci.logic
References: <tokimd$c7q9$1@dont-email.me> <Y4lrL.204366$8_id.12194@fx09.iad>
<tokocm$ct3m$1@dont-email.me> <gymrL.58668$SdR7.1356@fx04.iad>
<toktee$ct3m$3@dont-email.me> <p6nrL.24263$5S78.3335@fx48.iad>
<ton062$mkig$1@dont-email.me> <c8ErL.153012$gGD7.51143@fx11.iad>
<ton3n7$msft$2@dont-email.me> <9DFrL.108564$Tcw8.7605@fx10.iad>
<tonqqm$plfv$1@dont-email.me> <mZLrL.430121$GNG9.49737@fx18.iad>
<toocgp$u29q$1@dont-email.me> <LqPrL.59543$SdR7.255@fx04.iad>
<topgct$11eou$2@dont-email.me> <2DYrL.31899$4jN7.6964@fx02.iad>
<topnro$12an3$1@dont-email.me> <7EZrL.24698$b7Kc.23514@fx39.iad>
<topqd9$12gbh$1@dont-email.me> <Q%_rL.14622$ZhSc.13601@fx38.iad>
<topvb5$12up5$1@dont-email.me> <rL%rL.14722$ZhSc.3153@fx38.iad>
<toq2ra$13eo3$1@dont-email.me> <yH0sL.25579$Lfzc.19594@fx36.iad>
<tosal9$1emtp$1@dont-email.me> <o3ksL.30783$Olad.13377@fx35.iad>
<toso7u$1g8qb$1@dont-email.me> <G2nsL.14828$ZhSc.8210@fx38.iad>
<totajk$1hqog$2@dont-email.me>
From: Rich...@Damon-Family.org (Richard Damon)
In-Reply-To: <totajk$1hqog$2@dont-email.me>
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Lines: 253
Message-ID: <VmrsL.27464$cKvc.6795@fx42.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: Sun, 1 Jan 2023 21:32:19 -0500
X-Received-Bytes: 11477
 by: Richard Damon - Mon, 2 Jan 2023 02:32 UTC

On 1/1/23 8:04 PM, olcott wrote:
> On 1/1/2023 3:37 PM, Richard Damon wrote:
>> On 1/1/23 2:51 PM, olcott wrote:
>>> On 1/1/2023 12:13 PM, Richard Damon wrote:
>>>> On 1/1/23 10:59 AM, olcott wrote:
>>>>> On 12/31/2022 2:11 PM, Richard Damon wrote:
>>>>>> On 12/31/22 2:34 PM, olcott wrote:
>>>>>>> On 12/31/2022 1:07 PM, Richard Damon wrote:
>>>>>>>> On 12/31/22 1:34 PM, olcott wrote:
>>>>>>>>> On 12/31/2022 12:16 PM, Richard Damon wrote:
>>>>>>>>>> On 12/31/22 12:10 PM, olcott wrote:
>>>>>>>>>>
>>>>>>>>>>> This sentence is not true.
>>>>>>>>>>> is not true because it is self-contradictory.
>>>>>>>>>>
>>>>>>>>>> Right, and thus there can not be a Definition of Truth in the
>>>>>>>>>> system because if there was, you could show that statement True.
>>>>>>>>>
>>>>>>>>> 這句話不是真的: "This sentence is not true."
>>>>>>>>> The Chinese says "This sentence is not true:" referring to the
>>>>>>>>> English.
>>>>>>>>>
>>>>>>>>> The Chinese sentence is true because the English sentence is
>>>>>>>>> self-contradictory. This is an exact isomorphism to:
>>>>>>>>>
>>>>>>>>>    "sentence x which is undecidable in the original theory [my
>>>>>>>>> English]
>>>>>>>>>     becomes a decidable sentence in the enriched theory [my
>>>>>>>>> Chinese]."
>>>>>>>>>
>>>>>>>>
>>>>>>>> Which is a non-sequitor, showing you don't understand what you
>>>>>>>> are talking about.
>>>>>>>>
>>>>>>>> You are just proving your Stupidity.
>>>>>>>>
>>>>>>>> I don't think you even actually understand any of the basics of
>>>>>>>> logic.
>>>>>>>>
>>>>>>>> You can parrot words, but you show an utter lack of knowledge
>>>>>>>> about how any of it works.
>>>>>>>
>>>>>>> Try and paraphrase 100% perfectly exactly what you think that
>>>>>>> Tarski is
>>>>>>> saying. Any idiot (even a bot) can claim that someone is wrong.
>>>>>>
>>>>>> **Like you are doing**
>>>>>>
>>>>>>>
>>>>>>> It takes actual understanding to point out the exact error and the
>>>>>>> reason that it is an error.
>>>>>>>
>>>>>>>
>>>>>>
>>>>>> Why do we need to paraphrase?
>>>>>>
>>>>>> He says that a "Definition" of Truth, by which he means a way to
>>>>>> determine if a given arbitrary sentence expressed in the Theory is
>>>>>> True or False (or not a Truth Bearer) because, if such a
>>>>>> definition existed, then from that definition you could prove in
>>>>>> the defined Meta-Theory that a Statement like the Liar's Paradox
>>>>>> was actually True.
>>>>>>
>>>>>
>>>>> No that is incorrect. Tarski never indicated that he understood that
>>>>> expressions of formal language are not necessarily truth bearers.
>>>>
>>>>
>>>> Can yo PROVE that tement, have you read EVERYTHING he has written.
>>>>
>>>
>>> You made a claim that he understood this thus it is up to you to cite
>>> your reference.
>>
>> I did.
>>
>>>
>>> I claim that he does not understand this otherwise he would
>>> understand that the Liar Paradox is not a truth bearer and would have
>>> explicitly stated that: "the Liar Paradox is not a truth bearer".
>>
>> He knows that, that is why he points out that the fact that the
>> assumption of the existance of a Definition of Truth with the system,
>> the assumption of which allows him to prove (based on that assumption)
>> that the liar paradox is true, shows that it is impossible for there
>> to be a Defiition of Truth within the logic system.
>>
>> What don't YOU understand about that statement?
>>
>>>
>>>> He actually seems to understand this, because he uses the fact that
>>>> "proving" the Liar's Paradox, based on an assumed Thesis, shows the
>>>> assumed Thesis must be false.
>>>
>>> The way that Tarski said it: "This sentence is not true" is undecidable
>>> in his theory and true in his meta-theory.
>>
>> BASED ON THE ASSUMPTION OF THESIS A.
>>
>> Thus, THESIS A can't be true.
>>
>>>
>>> He never realized that what he really meant is that this sentence is
>>> not true in his theory: "This sentence is not true"
>>>
>>> and this sentence is true in his meta-theory:
>>> {This sentence is not true: "This sentence is not true"}
>>
>> Nope, that ISN'T what he is talking about. You just are not
>> understanding his words.
>>
>> You have shown enough misundetandings, the most like cause of any
>> disagreement between you and a respected logictian is that you don't
>> actually understand what he is saying.
>>
>> This is also a natural outcome of your MISAPPLICATION of the concept
>> of "First Principles".
>>
>>>
>>>>>
>>>>> This sentence is true:
>>>>> {The following sentence is not true: "This sentence is not true."}
>>>>>
>>>>>
>>>>>> Thus, since we know that can't be,
>>>>>
>>>>> Try and think of any expression of language that is true entirely
>>>>> on the
>>>>> basis of its meaning that does not have truthmaker connections to
>>>>> these
>>>>> semantic meanings.
>>>>
>>>> No one is arguing that.
>>>
>>> Hardly anyone seems to understand that the Liar Paradox is simply not a
>>> truth bearer otherwise tertiary logic would have never been created.
>>
>> No Nearly EVERYONE understands that in Binary Logic, the Liar Paracos
>> is simply not a Truth Bearer.
>>
>> Things like tertiary Logic are attempts to expand the logic system to
>> see if a system of logic could handle it.
>>
>> You DO understand the concepts of differing systems of logic with
>> different ground rules, don't you?
>>
>> Maybe you don't as that concept breaks you idea of an overarching
>> Meta-system that all logic falls under.
>>
>>>
>>> Every logic system only has expressions of language that are {true,
>>> false} or are not members of this formal system.
>>
>> Note members of THIS group of formal systems.
>>
>> Other formal systems have other values in their logic.
>>
>>>
>>>>>
>>>>> If no such counter example exists in the universe then that proves
>>>>> that
>>>>> I am correct about the requirement of semantic connections to truth
>>>>> makers.
>>>>
>>>> Right, but that doesn't make it PROVABLE by the definition of Provable.
>>>>
>>>
>>> Every element of the set of analytic knowledge is provable and the
>>> remaining elements of the set of analytic truth have unknown truth
>>> values.
>>
>> Yes, KNOWLEDGE is Provavle.
>>
>> TRUTH is not necessarily, as it may have an infinite set of
>> connections, which makes it outside the normal definition of Knowable.
>>
>>>
>>>>>
>>>>> Self-contradictory expressions of language have no truthmaker
>>>>> semantic connections.
>>>>>
>>>>> This also applies to expressions of language that have vacuous
>>>>> truth objects: "This sentence is true"
>>>>>
>>>>> True about what?
>>>>> True about being true.
>>>>> True about being true about what?
>>>>> True about being true about being true.
>>>>>
>>>>> Ah I see an infinitely recursive structure that never is never
>>>>> resolved
>>>>> to a truth value, thus not a truth bearer.
>>>>
>>>>
>>>>
>>>>>
>>>>>> there must not be an ability to define in a system of logic, a
>>>>>> "Definition of Truth" that allows you to determine (i.e. Proof)
>>>>>> every True Statement, Disprove every false statement, and
>>>>>> determine that every non-truthbearer was a non-truthbearer.
>>>>>>
>>>>>
>>>>> The possible requirement of an infinite proof requires that some
>>>>> expressions of language can only have an unknown Boolean value.
>>>>> We can't even tell that they definitely require an infinite proof.
>>>>
>>>> Right, its value is unknown in that Thoery, and thus unprovable in
>>>> that theory. A Meta-Theory may be able to show that it actually IS
>>>> true in that theory, and thus we have in the Theory a statment that
>>>> actually is True (but not KNOWN to be true in the Theory) that is
>>>> unprovable.
>>>>
>>>
>>> The correct "theory" of the set of analytic truth allows any order of
>>> reference from 0th order logic no N-ary logic.
>>>
>>> As Wittgenstein said true in a formal system means has been proved in
>>> this formal system and false in this formal system means that the
>>> opposite has been proved in this formal system.
>>
>> And he is WRONG in that statement,
>
> All expressions of language that are analytically true require a
> semantic connection to their truth maker.
>
> Try and show how an expression of language can be true in a formal
> system when that formal system cannot express any connection to the
> required truth maker of this expression.
>


Click here to read the complete article
Re: Tarski Undefinability Theorem is refuted

<jtrsL.27465$cKvc.12678@fx42.iad>

  copy mid

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

  copy link   Newsgroups: comp.theory comp.ai.philosophy sci.logic
Path: i2pn2.org!i2pn.org!usenet.blueworldhosting.com!feed1.usenet.blueworldhosting.com!peer02.iad!feed-me.highwinds-media.com!news.highwinds-media.com!fx42.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.6.1
Subject: Re: Tarski Undefinability Theorem is refuted
Content-Language: en-US
Newsgroups: comp.theory,comp.ai.philosophy,sci.logic
References: <tokimd$c7q9$1@dont-email.me> <Y4lrL.204366$8_id.12194@fx09.iad>
<tokocm$ct3m$1@dont-email.me> <gymrL.58668$SdR7.1356@fx04.iad>
<toktee$ct3m$3@dont-email.me> <p6nrL.24263$5S78.3335@fx48.iad>
<ton062$mkig$1@dont-email.me> <c8ErL.153012$gGD7.51143@fx11.iad>
<ton3n7$msft$2@dont-email.me> <9DFrL.108564$Tcw8.7605@fx10.iad>
<tonqqm$plfv$1@dont-email.me> <mZLrL.430121$GNG9.49737@fx18.iad>
<toocgp$u29q$1@dont-email.me> <LqPrL.59543$SdR7.255@fx04.iad>
<topgct$11eou$2@dont-email.me> <2DYrL.31899$4jN7.6964@fx02.iad>
<topnro$12an3$1@dont-email.me> <7EZrL.24698$b7Kc.23514@fx39.iad>
<topqd9$12gbh$1@dont-email.me> <Q%_rL.14622$ZhSc.13601@fx38.iad>
<topvb5$12up5$1@dont-email.me> <rL%rL.14722$ZhSc.3153@fx38.iad>
<toq2ra$13eo3$1@dont-email.me> <yH0sL.25579$Lfzc.19594@fx36.iad>
<tosal9$1emtp$1@dont-email.me> <o3ksL.30783$Olad.13377@fx35.iad>
<toso7u$1g8qb$1@dont-email.me> <G2nsL.14828$ZhSc.8210@fx38.iad>
<totc11$1hqog$6@dont-email.me>
From: Rich...@Damon-Family.org (Richard Damon)
In-Reply-To: <totc11$1hqog$6@dont-email.me>
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 7bit
Lines: 31
Message-ID: <jtrsL.27465$cKvc.12678@fx42.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: Sun, 1 Jan 2023 21:39:09 -0500
X-Received-Bytes: 3026
 by: Richard Damon - Mon, 2 Jan 2023 02:39 UTC

On 1/1/23 8:29 PM, olcott wrote:
> On 1/1/2023 3:37 PM, Richard Damon wrote:
>> On 1/1/23 2:51 PM, olcott wrote:

>>> Hardly anyone seems to understand that the Liar Paradox is simply not a
>>> truth bearer otherwise tertiary logic would have never been created.
>>
>> No Nearly EVERYONE understands that in Binary Logic, the Liar Paracos
>> is simply not a Truth Bearer.
>
> I don't think that all the people writing papers about how to resolve
> the Liar Paradox fail to understand binary logic.
>

Most INTELEGENT people trying to resolve the Liar's Paradox understand
Binary Logic, and are looking for logic beyond Binary Logic to see if
other Logical Paradigms might be able to handle that sort of thing (and
actually are probably looking at things more complicated then the simple
Liar's Paradox).

I will admit, that are probably a lot of DUMB people, who don't
understand logic, and are doing all sorts of dumb things, and if those
are hiting your radar, you need a better selection filter.

Of course, those are probably the works that you can sort of understand,
since they are at your level.

And actually, MOST people just understand that non-truth of the Liar's
Paradox and they leave it at that.

Re: Tarski Undefinability Theorem is refuted

<totgjd$1iia3$1@dont-email.me>

  copy mid

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

  copy link   Newsgroups: comp.theory comp.ai.philosophy sci.logic
Path: i2pn2.org!i2pn.org!eternal-september.org!reader01.eternal-september.org!.POSTED!not-for-mail
From: polco...@gmail.com (olcott)
Newsgroups: comp.theory,comp.ai.philosophy,sci.logic
Subject: Re: Tarski Undefinability Theorem is refuted
Date: Sun, 1 Jan 2023 20:47:08 -0600
Organization: A noiseless patient Spider
Lines: 177
Message-ID: <totgjd$1iia3$1@dont-email.me>
References: <tokimd$c7q9$1@dont-email.me> <Y4lrL.204366$8_id.12194@fx09.iad>
<tokocm$ct3m$1@dont-email.me> <gymrL.58668$SdR7.1356@fx04.iad>
<toktee$ct3m$3@dont-email.me> <p6nrL.24263$5S78.3335@fx48.iad>
<ton062$mkig$1@dont-email.me> <c8ErL.153012$gGD7.51143@fx11.iad>
<ton3n7$msft$2@dont-email.me> <9DFrL.108564$Tcw8.7605@fx10.iad>
<tonqqm$plfv$1@dont-email.me> <mZLrL.430121$GNG9.49737@fx18.iad>
<toocgp$u29q$1@dont-email.me> <LqPrL.59543$SdR7.255@fx04.iad>
<topgct$11eou$2@dont-email.me> <2DYrL.31899$4jN7.6964@fx02.iad>
<topnro$12an3$1@dont-email.me> <7EZrL.24698$b7Kc.23514@fx39.iad>
<topqd9$12gbh$1@dont-email.me> <Q%_rL.14622$ZhSc.13601@fx38.iad>
<topvb5$12up5$1@dont-email.me> <rL%rL.14722$ZhSc.3153@fx38.iad>
<toq2ra$13eo3$1@dont-email.me> <yH0sL.25579$Lfzc.19594@fx36.iad>
<toq5r8$13kvn$1@dont-email.me> <9C1sL.246623$9sn9.233359@fx17.iad>
<totbjh$1hqog$4@dont-email.me> <hdrsL.27463$cKvc.22029@fx42.iad>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Mon, 2 Jan 2023 02:47:09 -0000 (UTC)
Injection-Info: reader01.eternal-september.org; posting-host="aedfdee08f235ae0f6fbedbc56fd7c48";
logging-data="1657155"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1+mqT/U+anvNo2zIDsaFgJ6"
User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:102.0) Gecko/20100101
Thunderbird/102.6.1
Cancel-Lock: sha1:Tnw7TCoQ9gmCEbcFWOT5uHueyrg=
Content-Language: en-US
In-Reply-To: <hdrsL.27463$cKvc.22029@fx42.iad>
 by: olcott - Mon, 2 Jan 2023 02:47 UTC

On 1/1/2023 8:22 PM, Richard Damon wrote:
> On 1/1/23 8:21 PM, olcott wrote:
>> On 12/31/2022 3:13 PM, Richard Damon wrote:
>>> On 12/31/22 3:25 PM, olcott wrote:
>>>> On 12/31/2022 2:11 PM, Richard Damon wrote:
>>>>> On 12/31/22 2:34 PM, olcott wrote:
>>>>>> On 12/31/2022 1:07 PM, Richard Damon wrote:
>>>>>>> On 12/31/22 1:34 PM, olcott wrote:
>>>>>>>> On 12/31/2022 12:16 PM, Richard Damon wrote:
>>>>>>>>> On 12/31/22 12:10 PM, olcott wrote:
>>>>>>>>>
>>>>>>>>>> This sentence is not true.
>>>>>>>>>> is not true because it is self-contradictory.
>>>>>>>>>
>>>>>>>>> Right, and thus there can not be a Definition of Truth in the
>>>>>>>>> system because if there was, you could show that statement True.
>>>>>>>>
>>>>>>>> 這句話不是真的: "This sentence is not true."
>>>>>>>> The Chinese says "This sentence is not true:" referring to the
>>>>>>>> English.
>>>>>>>>
>>>>>>>> The Chinese sentence is true because the English sentence is
>>>>>>>> self-contradictory. This is an exact isomorphism to:
>>>>>>>>
>>>>>>>>    "sentence x which is undecidable in the original theory [my
>>>>>>>> English]
>>>>>>>>     becomes a decidable sentence in the enriched theory [my
>>>>>>>> Chinese]."
>>>>>>>>
>>>>>>>
>>>>>>> Which is a non-sequitor, showing you don't understand what you
>>>>>>> are talking about.
>>>>>>>
>>>>>>> You are just proving your Stupidity.
>>>>>>>
>>>>>>> I don't think you even actually understand any of the basics of
>>>>>>> logic.
>>>>>>>
>>>>>>> You can parrot words, but you show an utter lack of knowledge
>>>>>>> about how any of it works.
>>>>>>
>>>>>> Try and paraphrase 100% perfectly exactly what you think that
>>>>>> Tarski is
>>>>>> saying. Any idiot (even a bot) can claim that someone is wrong.
>>>>>
>>>>> **Like you are doing**
>>>>>
>>>>>>
>>>>>> It takes actual understanding to point out the exact error and the
>>>>>> reason that it is an error.
>>>>>>
>>>>>>
>>>>>
>>>>> Why do we need to paraphrase?
>>>>>
>>>>> He says that a "Definition" of Truth, by which he means a way to
>>>>> determine if a given arbitrary sentence expressed in the Theory is
>>>>> True or False (or not a Truth Bearer) because, if such a definition
>>>>> existed, then from that definition you could prove in the defined
>>>>> Meta-Theory that a Statement like the Liar's Paradox was actually
>>>>> True.
>>>>
>>>>
>>>> https://liarparadox.org/Tarski_275_276.pdf
>>>> That is not what he is saying, try again.
>>>
>>> Like you just said, even an idiot can just claim something is wrong.
>>>
>>> Note, since you aren't even showing the full chapter (which likely
>>> would be a copyright violation) its hard to get the full context of
>>> his statements, but thesse pages are
>>>
>>>>
>>>>>
>>>>> Thus, since we know that can't be, there must not be an ability to
>>>>> define in a system of logic, a "Definition of Truth" that allows
>>>>> you to determine (i.e. Proof) every True Statement, Disprove every
>>>>> false statement, and determine that every non-truthbearer was a
>>>>> non-truthbearer.
>>>>>
>>>>>
>>>>> What else do you think he is saying?
>>>>
>>>>    "sentence x which is undecidable in the original theory
>>>>     becomes a decidable sentence in the enriched theory"
>>>>
>>>>
>>>
>>> ACCORDING TO THESIS A, this isn't neccesarily true if Thesis A isn't
>>> True. In fact, I suspect this whole section is building up to showing
>>> this leads to a contradiction, and thus THESIS A isn't True.
>>>
>>> Remeber, at the end he says:
>>>
>>> I should like to draw attention here to an analogous result. For
>>> every deductive science in "Which arithmetic is contained it is
>>> possible to specify arithmetical notions which, so to speak, belong
>>> intuitively to this science, but ,vhich cannot be defined on the
>>> basis of this science. 'Vith the help of methods which are,
>>> completely analogous to those used in the copstruction of the
>>> definition of truth, it is nevertheless possible to show that these
>>> concepts can be so defined provided the science is enriched by the
>>> introduction of variables of higher order.
>>>
>>>
>>> Which points out that IN THE THEORY, there are things which can not
>>> be defined, but need to be expressed in a higher order Theory (the
>>> Meta Theory)
>>>
>>> By extension, there will be things in the Meta-Theory which can not
>>> be defined, but need to be expressed in an even HIGHER order Theory
>>> (a Meta-Meta-Theory) and so on.
>>>
>>
>> Or we could simply begin with 0 to N order logic and express any
>> analytic truth what-so-ever.
>>
>
> Until you get to an expression that needs N+1 order logic.
>

Are you saying that I might run out of natural numbers?

>> "This sentence is not true" is at one order of logic and untrue.
>>
>> This sentence is not true: "This sentence is not true" is at one
>> increment of higher order referring to the original order.
>>
>>> Thus in any Theory, or Meta^n Theory, there will ALWAYS be things
>>> that can not be defined.
>>>
>>
>> A finite order of logic can correctly specify any finite truth.
>> Most (if not all) infinite truths can be algorithmically compressed into
>> some finite logic.
>
> What is a "finite Truth", one that needs only a finite number of steps
> to get to it, you mean a PROBALBE truth?
>

"finite truth" is any truth that can be expressed in a finite number of
steps including specifying the algorithm for an infinite number of steps.

> Why do you say that "Most" infinite truths can be algoritmically
> commpressed? What evidence do you have of that,
>
> And if ANY of them can't, it says you have an unprovable truth.
>
>>
>>> You don't seem to understand how proof by contradiction works,
>>> because you mind is too simple.
>>
>> Right and you are one of the 16 people in the world with a six sigma IQ.
>> For an MIT grad I don't see the thrill in telling outrageous lies.
>>
>
> Actually, it more shows how little you should believe in single fixed
> tests. I will admit that I probably topped out the test and it wasn't
> properly calibrated at the high end, but that is the result it gave.
>
> Another test gave me a 150, and the tester admitted that that was as
> high as the test would go, and I was likely much higher, but that was
> more than high enough for what I was testing for.
>
> I put little enough faith it IQ tests that I haven't bothered trying a
> test really designed for top end people, because in my mind it doesn't
> really matter, because intelegence isn't a one dimensional thing that
> can be accurately measured.

I don't believe that you have an IQ anywhere near the top 1% much less
than the 185 IQ of top 2 in a billion. I could easily believe the top
5%, most everyone here is in the top 5%.

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

Re: Tarski Undefinability Theorem is refuted

<N_rsL.31284$rKDc.17869@fx34.iad>

  copy mid

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

  copy link   Newsgroups: comp.theory comp.ai.philosophy sci.logic
Path: i2pn2.org!i2pn.org!usenet.blueworldhosting.com!feed1.usenet.blueworldhosting.com!peer01.iad!feed-me.highwinds-media.com!news.highwinds-media.com!fx34.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.6.1
Subject: Re: Tarski Undefinability Theorem is refuted
Content-Language: en-US
Newsgroups: comp.theory,comp.ai.philosophy,sci.logic
References: <tokimd$c7q9$1@dont-email.me> <Y4lrL.204366$8_id.12194@fx09.iad>
<tokocm$ct3m$1@dont-email.me> <gymrL.58668$SdR7.1356@fx04.iad>
<toktee$ct3m$3@dont-email.me> <p6nrL.24263$5S78.3335@fx48.iad>
<ton062$mkig$1@dont-email.me> <c8ErL.153012$gGD7.51143@fx11.iad>
<ton3n7$msft$2@dont-email.me> <9DFrL.108564$Tcw8.7605@fx10.iad>
<tonqqm$plfv$1@dont-email.me> <mZLrL.430121$GNG9.49737@fx18.iad>
<toocgp$u29q$1@dont-email.me> <LqPrL.59543$SdR7.255@fx04.iad>
<topgct$11eou$2@dont-email.me> <2DYrL.31899$4jN7.6964@fx02.iad>
<topnro$12an3$1@dont-email.me> <7EZrL.24698$b7Kc.23514@fx39.iad>
<topqd9$12gbh$1@dont-email.me> <Q%_rL.14622$ZhSc.13601@fx38.iad>
<topvb5$12up5$1@dont-email.me> <rL%rL.14722$ZhSc.3153@fx38.iad>
<toq2ra$13eo3$1@dont-email.me> <yH0sL.25579$Lfzc.19594@fx36.iad>
<toq5r8$13kvn$1@dont-email.me> <9C1sL.246623$9sn9.233359@fx17.iad>
<totbjh$1hqog$4@dont-email.me> <hdrsL.27463$cKvc.22029@fx42.iad>
<totgjd$1iia3$1@dont-email.me>
From: Rich...@Damon-Family.org (Richard Damon)
In-Reply-To: <totgjd$1iia3$1@dont-email.me>
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 7bit
Lines: 12
Message-ID: <N_rsL.31284$rKDc.17869@fx34.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: Sun, 1 Jan 2023 22:14:53 -0500
X-Received-Bytes: 2124
 by: Richard Damon - Mon, 2 Jan 2023 03:14 UTC

On 1/1/23 9:47 PM, olcott wrote:

> I don't believe that you have an IQ anywhere near the top 1% much less
> than the 185 IQ of top 2 in a billion. I could easily believe the top
> 5%, most everyone here is in the top 5%.
>

Doesn't matter what you believe, as you have demonstrated that you don't
understand what is actually Truth.

Re: Tarski Undefinability Theorem is refuted

<totkqk$1lrpp$1@dont-email.me>

  copy mid

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

  copy link   Newsgroups: comp.theory comp.ai.philosophy sci.logic
Path: i2pn2.org!i2pn.org!eternal-september.org!reader01.eternal-september.org!.POSTED!not-for-mail
From: polco...@gmail.com (olcott)
Newsgroups: comp.theory,comp.ai.philosophy,sci.logic
Subject: Re: Tarski Undefinability Theorem is refuted
Date: Sun, 1 Jan 2023 21:59:14 -0600
Organization: A noiseless patient Spider
Lines: 249
Message-ID: <totkqk$1lrpp$1@dont-email.me>
References: <tokimd$c7q9$1@dont-email.me> <Y4lrL.204366$8_id.12194@fx09.iad>
<tokocm$ct3m$1@dont-email.me> <gymrL.58668$SdR7.1356@fx04.iad>
<toktee$ct3m$3@dont-email.me> <p6nrL.24263$5S78.3335@fx48.iad>
<ton062$mkig$1@dont-email.me> <c8ErL.153012$gGD7.51143@fx11.iad>
<ton3n7$msft$2@dont-email.me> <9DFrL.108564$Tcw8.7605@fx10.iad>
<tonqqm$plfv$1@dont-email.me> <mZLrL.430121$GNG9.49737@fx18.iad>
<toocgp$u29q$1@dont-email.me> <LqPrL.59543$SdR7.255@fx04.iad>
<topgct$11eou$2@dont-email.me> <2DYrL.31899$4jN7.6964@fx02.iad>
<topnro$12an3$1@dont-email.me> <7EZrL.24698$b7Kc.23514@fx39.iad>
<topqd9$12gbh$1@dont-email.me> <Q%_rL.14622$ZhSc.13601@fx38.iad>
<topvb5$12up5$1@dont-email.me> <rL%rL.14722$ZhSc.3153@fx38.iad>
<toq2ra$13eo3$1@dont-email.me> <yH0sL.25579$Lfzc.19594@fx36.iad>
<tosal9$1emtp$1@dont-email.me> <o3ksL.30783$Olad.13377@fx35.iad>
<toso7u$1g8qb$1@dont-email.me> <G2nsL.14828$ZhSc.8210@fx38.iad>
<totajk$1hqog$2@dont-email.me> <VmrsL.27464$cKvc.6795@fx42.iad>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Mon, 2 Jan 2023 03:59:16 -0000 (UTC)
Injection-Info: reader01.eternal-september.org; posting-host="aedfdee08f235ae0f6fbedbc56fd7c48";
logging-data="1765177"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1+3gBpPdJu0W28Oj1gkSIZu"
User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:102.0) Gecko/20100101
Thunderbird/102.6.1
Cancel-Lock: sha1:zTt1OY8/0InQf1tIiGzO/FIEuiw=
Content-Language: en-US
In-Reply-To: <VmrsL.27464$cKvc.6795@fx42.iad>
 by: olcott - Mon, 2 Jan 2023 03:59 UTC

On 1/1/2023 8:32 PM, Richard Damon wrote:
> On 1/1/23 8:04 PM, olcott wrote:
>> On 1/1/2023 3:37 PM, Richard Damon wrote:
>>> On 1/1/23 2:51 PM, olcott wrote:
>>>> On 1/1/2023 12:13 PM, Richard Damon wrote:
>>>>> On 1/1/23 10:59 AM, olcott wrote:
>>>>>> On 12/31/2022 2:11 PM, Richard Damon wrote:
>>>>>>> On 12/31/22 2:34 PM, olcott wrote:
>>>>>>>> On 12/31/2022 1:07 PM, Richard Damon wrote:
>>>>>>>>> On 12/31/22 1:34 PM, olcott wrote:
>>>>>>>>>> On 12/31/2022 12:16 PM, Richard Damon wrote:
>>>>>>>>>>> On 12/31/22 12:10 PM, olcott wrote:
>>>>>>>>>>>
>>>>>>>>>>>> This sentence is not true.
>>>>>>>>>>>> is not true because it is self-contradictory.
>>>>>>>>>>>
>>>>>>>>>>> Right, and thus there can not be a Definition of Truth in the
>>>>>>>>>>> system because if there was, you could show that statement True.
>>>>>>>>>>
>>>>>>>>>> 這句話不是真的: "This sentence is not true."
>>>>>>>>>> The Chinese says "This sentence is not true:" referring to the
>>>>>>>>>> English.
>>>>>>>>>>
>>>>>>>>>> The Chinese sentence is true because the English sentence is
>>>>>>>>>> self-contradictory. This is an exact isomorphism to:
>>>>>>>>>>
>>>>>>>>>>    "sentence x which is undecidable in the original theory [my
>>>>>>>>>> English]
>>>>>>>>>>     becomes a decidable sentence in the enriched theory [my
>>>>>>>>>> Chinese]."
>>>>>>>>>>
>>>>>>>>>
>>>>>>>>> Which is a non-sequitor, showing you don't understand what you
>>>>>>>>> are talking about.
>>>>>>>>>
>>>>>>>>> You are just proving your Stupidity.
>>>>>>>>>
>>>>>>>>> I don't think you even actually understand any of the basics of
>>>>>>>>> logic.
>>>>>>>>>
>>>>>>>>> You can parrot words, but you show an utter lack of knowledge
>>>>>>>>> about how any of it works.
>>>>>>>>
>>>>>>>> Try and paraphrase 100% perfectly exactly what you think that
>>>>>>>> Tarski is
>>>>>>>> saying. Any idiot (even a bot) can claim that someone is wrong.
>>>>>>>
>>>>>>> **Like you are doing**
>>>>>>>
>>>>>>>>
>>>>>>>> It takes actual understanding to point out the exact error and the
>>>>>>>> reason that it is an error.
>>>>>>>>
>>>>>>>>
>>>>>>>
>>>>>>> Why do we need to paraphrase?
>>>>>>>
>>>>>>> He says that a "Definition" of Truth, by which he means a way to
>>>>>>> determine if a given arbitrary sentence expressed in the Theory
>>>>>>> is True or False (or not a Truth Bearer) because, if such a
>>>>>>> definition existed, then from that definition you could prove in
>>>>>>> the defined Meta-Theory that a Statement like the Liar's Paradox
>>>>>>> was actually True.
>>>>>>>
>>>>>>
>>>>>> No that is incorrect. Tarski never indicated that he understood that
>>>>>> expressions of formal language are not necessarily truth bearers.
>>>>>
>>>>>
>>>>> Can yo PROVE that tement, have you read EVERYTHING he has written.
>>>>>
>>>>
>>>> You made a claim that he understood this thus it is up to you to cite
>>>> your reference.
>>>
>>> I did.
>>>
>>>>
>>>> I claim that he does not understand this otherwise he would
>>>> understand that the Liar Paradox is not a truth bearer and would
>>>> have explicitly stated that: "the Liar Paradox is not a truth bearer".
>>>
>>> He knows that, that is why he points out that the fact that the
>>> assumption of the existance of a Definition of Truth with the system,
>>> the assumption of which allows him to prove (based on that
>>> assumption) that the liar paradox is true, shows that it is
>>> impossible for there to be a Defiition of Truth within the logic system.
>>>
>>> What don't YOU understand about that statement?
>>>
>>>>
>>>>> He actually seems to understand this, because he uses the fact that
>>>>> "proving" the Liar's Paradox, based on an assumed Thesis, shows the
>>>>> assumed Thesis must be false.
>>>>
>>>> The way that Tarski said it: "This sentence is not true" is undecidable
>>>> in his theory and true in his meta-theory.
>>>
>>> BASED ON THE ASSUMPTION OF THESIS A.
>>>
>>> Thus, THESIS A can't be true.
>>>
>>>>
>>>> He never realized that what he really meant is that this sentence is
>>>> not true in his theory: "This sentence is not true"
>>>>
>>>> and this sentence is true in his meta-theory:
>>>> {This sentence is not true: "This sentence is not true"}
>>>
>>> Nope, that ISN'T what he is talking about. You just are not
>>> understanding his words.
>>>
>>> You have shown enough misundetandings, the most like cause of any
>>> disagreement between you and a respected logictian is that you don't
>>> actually understand what he is saying.
>>>
>>> This is also a natural outcome of your MISAPPLICATION of the concept
>>> of "First Principles".
>>>
>>>>
>>>>>>
>>>>>> This sentence is true:
>>>>>> {The following sentence is not true: "This sentence is not true."}
>>>>>>
>>>>>>
>>>>>>> Thus, since we know that can't be,
>>>>>>
>>>>>> Try and think of any expression of language that is true entirely
>>>>>> on the
>>>>>> basis of its meaning that does not have truthmaker connections to
>>>>>> these
>>>>>> semantic meanings.
>>>>>
>>>>> No one is arguing that.
>>>>
>>>> Hardly anyone seems to understand that the Liar Paradox is simply not a
>>>> truth bearer otherwise tertiary logic would have never been created.
>>>
>>> No Nearly EVERYONE understands that in Binary Logic, the Liar Paracos
>>> is simply not a Truth Bearer.
>>>
>>> Things like tertiary Logic are attempts to expand the logic system to
>>> see if a system of logic could handle it.
>>>
>>> You DO understand the concepts of differing systems of logic with
>>> different ground rules, don't you?
>>>
>>> Maybe you don't as that concept breaks you idea of an overarching
>>> Meta-system that all logic falls under.
>>>
>>>>
>>>> Every logic system only has expressions of language that are {true,
>>>> false} or are not members of this formal system.
>>>
>>> Note members of THIS group of formal systems.
>>>
>>> Other formal systems have other values in their logic.
>>>
>>>>
>>>>>>
>>>>>> If no such counter example exists in the universe then that proves
>>>>>> that
>>>>>> I am correct about the requirement of semantic connections to truth
>>>>>> makers.
>>>>>
>>>>> Right, but that doesn't make it PROVABLE by the definition of
>>>>> Provable.
>>>>>
>>>>
>>>> Every element of the set of analytic knowledge is provable and the
>>>> remaining elements of the set of analytic truth have unknown truth
>>>> values.
>>>
>>> Yes, KNOWLEDGE is Provavle.
>>>
>>> TRUTH is not necessarily, as it may have an infinite set of
>>> connections, which makes it outside the normal definition of Knowable.
>>>
>>>>
>>>>>>
>>>>>> Self-contradictory expressions of language have no truthmaker
>>>>>> semantic connections.
>>>>>>
>>>>>> This also applies to expressions of language that have vacuous
>>>>>> truth objects: "This sentence is true"
>>>>>>
>>>>>> True about what?
>>>>>> True about being true.
>>>>>> True about being true about what?
>>>>>> True about being true about being true.
>>>>>>
>>>>>> Ah I see an infinitely recursive structure that never is never
>>>>>> resolved
>>>>>> to a truth value, thus not a truth bearer.
>>>>>
>>>>>
>>>>>
>>>>>>
>>>>>>> there must not be an ability to define in a system of logic, a
>>>>>>> "Definition of Truth" that allows you to determine (i.e. Proof)
>>>>>>> every True Statement, Disprove every false statement, and
>>>>>>> determine that every non-truthbearer was a non-truthbearer.
>>>>>>>
>>>>>>
>>>>>> The possible requirement of an infinite proof requires that some
>>>>>> expressions of language can only have an unknown Boolean value.
>>>>>> We can't even tell that they definitely require an infinite proof.
>>>>>
>>>>> Right, its value is unknown in that Thoery, and thus unprovable in
>>>>> that theory. A Meta-Theory may be able to show that it actually IS
>>>>> true in that theory, and thus we have in the Theory a statment that
>>>>> actually is True (but not KNOWN to be true in the Theory) that is
>>>>> unprovable.
>>>>>
>>>>
>>>> The correct "theory" of the set of analytic truth allows any order
>>>> of reference from 0th order logic no N-ary logic.
>>>>
>>>> As Wittgenstein said true in a formal system means has been proved in
>>>> this formal system and false in this formal system means that the
>>>> opposite has been proved in this formal system.
>>>
>>> And he is WRONG in that statement,
>>
>> All expressions of language that are analytically true require a
>> semantic connection to their truth maker.
>>
>> Try and show how an expression of language can be true in a formal
>> system when that formal system cannot express any connection to the
>> required truth maker of this expression.
>>
>
> So you still don't understand the difference between having a semantic
> connenction (which might be infinite) to being proven (which must be
> finite in the system in question).
>


Click here to read the complete article
Re: Tarski Undefinability Theorem is refuted

<totlkm$1lrpp$2@dont-email.me>

  copy mid

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

  copy link   Newsgroups: comp.theory comp.ai.philosophy sci.logic
Path: i2pn2.org!i2pn.org!eternal-september.org!reader01.eternal-september.org!.POSTED!not-for-mail
From: polco...@gmail.com (olcott)
Newsgroups: comp.theory,comp.ai.philosophy,sci.logic
Subject: Re: Tarski Undefinability Theorem is refuted
Date: Sun, 1 Jan 2023 22:13:10 -0600
Organization: A noiseless patient Spider
Lines: 58
Message-ID: <totlkm$1lrpp$2@dont-email.me>
References: <tokimd$c7q9$1@dont-email.me> <Y4lrL.204366$8_id.12194@fx09.iad>
<tokocm$ct3m$1@dont-email.me> <gymrL.58668$SdR7.1356@fx04.iad>
<toktee$ct3m$3@dont-email.me> <p6nrL.24263$5S78.3335@fx48.iad>
<ton062$mkig$1@dont-email.me> <c8ErL.153012$gGD7.51143@fx11.iad>
<ton3n7$msft$2@dont-email.me> <9DFrL.108564$Tcw8.7605@fx10.iad>
<tonqqm$plfv$1@dont-email.me> <mZLrL.430121$GNG9.49737@fx18.iad>
<toocgp$u29q$1@dont-email.me> <LqPrL.59543$SdR7.255@fx04.iad>
<topgct$11eou$2@dont-email.me> <2DYrL.31899$4jN7.6964@fx02.iad>
<topnro$12an3$1@dont-email.me> <7EZrL.24698$b7Kc.23514@fx39.iad>
<topqd9$12gbh$1@dont-email.me> <Q%_rL.14622$ZhSc.13601@fx38.iad>
<topvb5$12up5$1@dont-email.me> <rL%rL.14722$ZhSc.3153@fx38.iad>
<toq2ra$13eo3$1@dont-email.me> <yH0sL.25579$Lfzc.19594@fx36.iad>
<tosal9$1emtp$1@dont-email.me> <o3ksL.30783$Olad.13377@fx35.iad>
<toso7u$1g8qb$1@dont-email.me> <G2nsL.14828$ZhSc.8210@fx38.iad>
<totc11$1hqog$6@dont-email.me> <jtrsL.27465$cKvc.12678@fx42.iad>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 7bit
Injection-Date: Mon, 2 Jan 2023 04:13:11 -0000 (UTC)
Injection-Info: reader01.eternal-september.org; posting-host="aedfdee08f235ae0f6fbedbc56fd7c48";
logging-data="1765177"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1+MBU3nUKaeWm62JxsyO8xI"
User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:102.0) Gecko/20100101
Thunderbird/102.6.1
Cancel-Lock: sha1:TuomKwwfe1HnK/qiPz1YP+YSEDo=
In-Reply-To: <jtrsL.27465$cKvc.12678@fx42.iad>
Content-Language: en-US
 by: olcott - Mon, 2 Jan 2023 04:13 UTC

On 1/1/2023 8:39 PM, Richard Damon wrote:
> On 1/1/23 8:29 PM, olcott wrote:
>> On 1/1/2023 3:37 PM, Richard Damon wrote:
>>> On 1/1/23 2:51 PM, olcott wrote:
>
>>>> Hardly anyone seems to understand that the Liar Paradox is simply not a
>>>> truth bearer otherwise tertiary logic would have never been created.
>>>
>>> No Nearly EVERYONE understands that in Binary Logic, the Liar Paracos
>>> is simply not a Truth Bearer.
>>
>> I don't think that all the people writing papers about how to resolve
>> the Liar Paradox fail to understand binary logic.
>>
>
> Most INTELEGENT people trying to resolve the Liar's Paradox understand
> Binary Logic, and are looking for logic beyond Binary Logic to see if
> other Logical Paradigms might be able to handle that sort of thing (and
> actually are probably looking at things more complicated then the simple
> Liar's Paradox).
>

Anyone that is trying to resolve an expression of language that is not a
truth bearer to a truth value is on a fools errand.

>
> I will admit, that are probably a lot of DUMB people, who don't
> understand logic, and are doing all sorts of dumb things, and if those
> are hiting your radar, you need a better selection filter.
>

Saul Kripke was by no means any sort of dumb
https://www.impan.pl/~kz/truthseminar/Kripke_Outline.pdf

> Of course, those are probably the works that you can sort of understand,
> since they are at your level.
>
> And actually, MOST people just understand that non-truth of the Liar's
> Paradox and they leave it at that.
>

Tarski "proved" that truth cannot be specified and used the Liar Paradox
as the foundation of this proof.

That is like proving the angel food cakes cannot be baked because the
cannot be made from house bricks.

His entire proof is on pages 275-276:
http://www.thatmarcusfamily.org/philosophy/Course_Websites/Readings/Tarski%20-%20The%20Concept%20of%20Truth%20in%20Formalized%20Languages.pdf

I was able to get Adobe Acrobat to OCR that text, it worked quite well.
This allows keyword searches.

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

Pages:12345
server_pubkey.txt

rocksolid light 0.9.81
clearnet tor