Deutsch   English   Français   Italiano  
<7a8285459d5e250280bfd48199b311ccf3c33099@i2pn2.org>

View for Bookmarking (what is this?)
Look up another Usenet article

Path: ...!weretis.net!feeder9.news.weretis.net!news.nk.ca!rocksolid2!i2pn2.org!.POSTED!not-for-mail
From: Richard Damon <richard@damon-family.org>
Newsgroups: sci.logic
Subject: Re: How a True(X) predicate can be defined for the set of analytic
 knowledge
Date: Sat, 29 Mar 2025 14:28:31 -0400
Organization: i2pn2 (i2pn.org)
Message-ID: <7a8285459d5e250280bfd48199b311ccf3c33099@i2pn2.org>
References: <vrfvbd$256og$2@dont-email.me> <vrh432$39r47$1@dont-email.me>
 <vrhami$3fbja$2@dont-email.me> <vrj9lu$1791p$1@dont-email.me>
 <vrjn82$1ilbe$2@dont-email.me> <vrmpc1$bnp3$1@dont-email.me>
 <vrmteo$cvat$6@dont-email.me> <vru000$33rof$1@dont-email.me>
 <vrug71$3gia2$6@dont-email.me> <vs0e9v$1cg8n$1@dont-email.me>
 <vs1fda$296sp$3@dont-email.me> <vs3b1d$3aoq$1@dont-email.me>
 <vs3iap$9lob$1@dont-email.me>
 <4def165aebe9e5753eeb66673c705370b247a7e3@i2pn2.org>
 <vs4utt$1c1ja$12@dont-email.me>
 <82344d9130ea950af2f0ff091a19265242b9608a@i2pn2.org>
 <vs6u85$39556$16@dont-email.me>
 <567c32439deb84febf4111f4bd0792a9538c1ba1@i2pn2.org>
 <vs902d$1fccq$4@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Sat, 29 Mar 2025 18:48:34 -0000 (UTC)
Injection-Info: i2pn2.org;
	logging-data="2290707"; mail-complaints-to="usenet@i2pn2.org";
	posting-account="diqKR1lalukngNWEqoq9/uFtbkm5U+w3w6FQ0yesrXg";
User-Agent: Mozilla Thunderbird
In-Reply-To: <vs902d$1fccq$4@dont-email.me>
Content-Language: en-US
X-Spam-Checker-Version: SpamAssassin 4.0.0
Bytes: 8849
Lines: 169

On 3/29/25 10:28 AM, olcott wrote:
> On 3/28/2025 4:50 PM, Richard Damon wrote:
>> On 3/28/25 3:45 PM, olcott wrote:
>>> On 3/28/2025 5:33 AM, joes wrote:
>>>> Am Thu, 27 Mar 2025 20:44:28 -0500 schrieb olcott:
>>>>> On 3/27/2025 6:08 PM, Richard Damon wrote:
>>>>>> On 3/27/25 9:03 AM, olcott wrote:
>>>>>>> On 3/27/2025 5:58 AM, Mikko wrote:
>>>>>>>> On 2025-03-26 18:01:14 +0000, olcott said:
>>>>>>>>> On 3/26/2025 3:36 AM, Mikko wrote:
>>>>
>>>>>>>>> I am NOT referring to what is merely presented as the body of
>>>>>>>>> general knowledge, I am referring to the actual body of general
>>>>>>>>> knowledge. Within this hypothesis it is easy to see that True(X)
>>>>>>>>> would be infallible.
>>>>>>>>
>>>>>>>> In that case your True(X) is uncomputable and any theory that
>>>>>>>> contains it is incomplete.
>>>>>>>>
>>>>>>> The body of general knowledge that can be expressed using 
>>>>>>> language is
>>>>>>> defined to be complete. The moment that new knowledge that can be
>>>>>>> expressed in language comes into existence it is added to the set.
>>>>>>>
>>>>>> No its not. We KNOW there are things we don't know yet, but hope to.
>>>>>>
>>>>> As soon as the first person knows new general knowledge and this
>>>>> knowledge can be written down (unlike the actual direct physical
>>>>> sensation of smelling a rose)
>>>>> then this becomes an element of this set of knowledge.
>>>>>
>>>>>> And, the base of a logic system is STATIC and fixed.
>>>>> The set of general knowledge that can be expressed in language has 
>>>>> more
>>>>> flexibility than that.
>>>>>
>>>>>> You just don't understand the meaning of the words you are using.
>>>>>>
>>>>>>> True(X) merely tests for membership in this set;
>>>>>>> (a) Is X a Basic Fact? Then X is true.
>>>>>> Which makes it not a TRUTH test, but a KNOWLEDGE test, and thus not
>>>>>> names right.
>>>>> The set of all general knowledge that can be expressed in language 
>>>>> is a
>>>>> subset of all truth and only excludes unknown and unknowable.
>>>
>>>> Exactly, it doesn't include the unknown truths and ought to be called
>>>> Known(X). It is also contradictory since it gives NO both for unknowns
>>>> and their negation.
>>>>
>>>
>>> *The key defining aspect of knowledge is that it is true*
>>
>> Which has been the eternal debate, how can we tell if some "fact" we 
>> have discovered is true.
>>
>> In FORMAL LOGIC (which you just dismissed) truth has a solid 
>> definition, and we can formally PROVE some statements to be true and 
>> formally PROVE that some statements are just false, and thus such 
>> statements CAN become truely established knowledge. There may also be 
>> some statements we have not established yet (and maybe can never 
>> establish in the system) which will remain as "unknown". That doesn't 
>> mean the statements might not be true or false, just that we don't 
>> know the answer yet.
>>
> 
> This can be incoherent unless complete semantics is fully
> integrated into the formal system. There is no way that
> applying ONLY truth preserving operations to basic facts
> can possibly result in undecidability.

The problem is that your version of "semantics" is just incompatible 
with "Formal Logic".

> 
> Only a valid concrete counter-example counts as a rebuttal,
> everything else counts as some sort of deception.

So, you admit that all your work is just a deception,

> 
>>> When LLM systems have all of the basic facts encoded and
>>> are only allowed to perform truth preserving operations
>>> on these basic facts:
>>> (a) They won't be able to hallucinate
>>> (b) They will have the basis to shut down the lies
>>>      of liars before these lies have any effect.
>>
>> Since LLM are only approximation machines, that is totally NOT the 
>> results.
>>
> They are currently stochastic. They can be anchored in
> a deterministic foundation. This allows the system to
> divide its knowing into two (a) Logically true
> (b) Reasonably plausible.

No, they are NOT stochastic as their basis, but are fully deterministic. 
Sometimes they will add a bit of randomness so they don't always give 
the same answer to a prompt, but the whole Neural Network is a finite 
determinstic computation. The input is parsed into predefined tokens 
with value

> 
>> And, only if the people you want to call liars have accepted your 
>> initial set of facts (which they won't), as almost all of the 
>> arguments are over interpretation of data, which is something that can 
>> not be logically difinitively proven.
>>
> 
> When people fully understand that there has never ever
> been any actual evidence of election fraud that could
> have possibly changed the outcome of the 2020 presidential
> election and this can be fully explained to them at their
> own language level than many will begin to see the light.

Which isn't a PROOF of the claim that there wasn't.

Basic rule: Absence of proof is NOT proof of absence.

> 
>> Your problem has always been, it seems, that you just don't understand 
>> that fact, that basically ALL knowledge about the "real world" is 
>> either based on emperical observation, taken to be a "truth" because 
>> the vast majority accepts the conclusions from the observaitions, or is 
> 
> It is a verified fact that there never has been any actual
> evidence of election fraud that has ever been presented that
> could have possibly changed the outcome of the 2020 presidential
> election.  If there ever was any then present it now or
> implicitly acknowledge that you have always been lying.

And absence of proof is not proof of absence.

There HAVE been cases where similar claims could have been made of no 
current evidence of wrong-doing, where later evidence to prove 
wrong-doing have been found, showing why the statement that the absence 
of proof is not proof of absence.

People who choose to believe that there could be a well hidden 
conspiricy to change things have historical evidence that such things 
have been done in the past and kept hidden for extended periods of time.

> 
>> definitional based upon agreed upon terminology. (So "Cats are 
>> Animals" can be true based upon an agreed upon meaning of the words 
>> coupled with the observation of in the world that the thing we think 
>> of as those terms matches our definitions.)
>>
>> Many big "breakthroughs" have been made when we realize a base 
>> assumption in our definitions about the world were incorrect.
>>
>>
>>>
>>>>>>> (b) Can X be derived by applying truth preserving operations
>>>>>>>       to Basic Facts? Then X is true.
>>>>>> But that isn't the membershop test you just mentioned, and it is that
>>>>>> op[eration which Tarski specifically showed can not be done.
>>>>>> The problem is TRUTH can be establish via an infinite set of truth
>>>>>> perserving operations, but knowledge can not.
>>>>> None of this makes any actual difference in the world.
>>>>> We won't be able to prevent nuclear Winter and the extinction of
>>>>> humanity on the basis of knowing whether or not the Goldbach 
>>>>> conjecture
>>>>> is true.
>>>
========== REMAINDER OF ARTICLE TRUNCATED ==========