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

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

Path: ...!weretis.net!feeder9.news.weretis.net!i2pn.org!i2pn2.org!.POSTED!not-for-mail
From: Richard Damon <richard@damon-family.org>
Newsgroups: sci.logic
Subject: Re: Minimal Logics in the 2020's: A Meteoric Rise
Date: Fri, 5 Jul 2024 12:23:26 -0400
Organization: i2pn2 (i2pn.org)
Message-ID: <ba31e5eebae5a2b987f1ff1ec5886f00f59dc3b5@i2pn2.org>
References: <v67685$6fr5$1@solani.org> <v676rf$2u7lu$1@dont-email.me>
 <v67i45$6keq$1@solani.org> <v67j9a$2vtu0$2@dont-email.me>
 <v67jvc$6l2j$1@solani.org> <v67mbp$349l4$1@dont-email.me>
 <4394939716c6c6d2ed1fa9b5a269ed261768914e@i2pn2.org>
 <v67ono$34d9q$1@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Fri, 5 Jul 2024 16:23:27 -0000 (UTC)
Injection-Info: i2pn2.org;
	logging-data="2247596"; mail-complaints-to="usenet@i2pn2.org";
	posting-account="diqKR1lalukngNWEqoq9/uFtbkm5U+w3w6FQ0yesrXg";
User-Agent: Mozilla Thunderbird
Content-Language: en-US
In-Reply-To: <v67ono$34d9q$1@dont-email.me>
X-Spam-Checker-Version: SpamAssassin 4.0.0
Bytes: 4323
Lines: 74

On 7/4/24 11:19 PM, olcott wrote:
> On 7/4/2024 10:00 PM, Richard Damon wrote:
>> On 7/4/24 10:38 PM, olcott wrote:
>>> On 7/4/2024 8:58 PM, Mild Shock wrote:
>>>>
>>>> When red means blue, and yellow means
>>>> green, then black is white. Thanks for your hint!
>>>>
>>>> If my Grandmother had wheels she would have been a bike
>>>> https://www.youtube.com/watch?v=OplyHCIBmfE
>>>>
>>>
>>> *Here is the same thing more clearly*
>>> Every expression of language that is {true on the basis of
>>> its verbal meaning} is only made true by a sequence of truth
>>> preserving operations to this {verbal meaning}.
>>>
>>> The only way that we know that puppies are not fifteen
>>> story office buildings is that the accurate verbal model
>>> of the actual world tells use so.
>>
>> But, even if we can't find that sequence of truth perserving 
>> operations, but one exists (which might be infinite) makes the 
>> statement true, but not known.
>>
>> This is one of your confusions, You confuse a statment being True, 
>> with the statement being KNOWN to be True.
>>
>> There are a number of great problems and conjectures that seem to be 
>> true, but we can not prove them. They MUST be either True or False, as 
>> by their nature, there is no middle ground (something either exsits or 
>> it doesn't, or the count of something is either finite or infinite).
>>
>> The ACTUAL TRUTH  (or falsehood) of such a statement is thus firmly 
>> established by the system in which the conjeture is embedded, even if 
>> our knowledge of the value of the truth of the statement is not known, 
>> or possible even knowable.
>>
>> The concept of "incompleteness" for a logical system is a recognition 
>> that the system has grown powerful enough that there exist some truths 
>> in the system that no finite proof of those statements exist, and only 
>> infinite chains of inference in the system can establish it.
>>
>> Mathematics is one source for these sorts of truths, as the possiblity 
>> of problems having NO number that satisfy them, or an infinite number 
>> that satisfy them show paths that can use in infinite number of steps 
>> to prove them, and might only be provable if some "inductive" shortcut 
>> can be found.
>>
> 
> Yet my system screens out pathological expressions that
> are incorrectly determined to be incompleteness of the
> formal system. When we do that then True(L,x) can be defined
> for every expression not requiring an infinite sequence
> of steps. True(L,x) or True(L,~x) or not a truth bearer in L.

No, it dies in self-inconsistency.

Note "Every expression BUT ..."  isn't "Every expresion ."

So, your logic only works in systems small enough to be somewhat akin to 
toys. Those that are limited enough not to be able to cause the 
problems, which means it excludes most systems that support math.

> 
>>>
>>>> olcott schrieb:
>>>>> When provable means true and false means unprovable
>>>>> then (Γ ⊢ X) means X is true in Γ.
>>>>> then (Γ ⊢ ~X) means X is conventional false  in Γ.
>>>>> the (Γ ⊬ X) ∧ (Γ ⊬ ~X) X is not a truth bearer in Γ.
>>>
>>
>