Path: ...!eternal-september.org!feeder3.eternal-september.org!news.quux.org!news.nk.ca!rocksolid2!i2pn2.org!.POSTED!not-for-mail
From: Richard Damon <richard@damon-family.org>
Newsgroups: sci.logic
Subject: Re: Mathematical incompleteness has always been a misconception ---
 Tarski
Date: Sat, 22 Feb 2025 22:56:36 -0500
Organization: i2pn2 (i2pn.org)
Message-ID: <f70c2d50fc9beb7a08861db5cfb57e2b7e33e7b7@i2pn2.org>
References: <vnh0sq$35mcm$1@dont-email.me> <vnndqs$kef3$1@dont-email.me>
 <vnpd96$vl84$1@dont-email.me> <vnqm3p$1apip$1@dont-email.me>
 <vnqsbh$1c5sq$1@dont-email.me> <vnsm90$1pr86$1@dont-email.me>
 <vnte6s$1tra8$1@dont-email.me> <vnv4tf$2a43e$1@dont-email.me>
 <vo0249$2eqdl$1@dont-email.me> <vo1qae$2s4cr$1@dont-email.me>
 <vo2i10$302f0$1@dont-email.me> <vo4nj4$3f6so$1@dont-email.me>
 <vo5btf$3ipo2$1@dont-email.me> <vo7ckh$q2p$1@dont-email.me>
 <vo7tdg$36ra$6@dont-email.me> <voa09t$idij$1@dont-email.me>
 <7e532aaf77653daac5ca2b70bf26d0a3bc515abf@i2pn2.org>
 <voceuj$14r1q$1@dont-email.me> <vocp21$16c4e$1@dont-email.me>
 <vof6hb$1nh1f$1@dont-email.me> <voflif$1q1mh$2@dont-email.me>
 <vohsmu$29krm$1@dont-email.me> <vp10ic$1e7iv$2@dont-email.me>
 <vp6qjb$2ousc$1@dont-email.me> <vpb1le$3jct4$13@dont-email.me>
 <0f7cd503773838ad12f124f23106d53552e277b8@i2pn2.org>
 <vpbknk$3qig2$1@dont-email.me>
 <3f6b6d62980de92789a1fdd5d22cdcc351ec473a@i2pn2.org>
 <vpd0lb$irt$7@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Sun, 23 Feb 2025 03:56:37 -0000 (UTC)
Injection-Info: i2pn2.org;
	logging-data="1346175"; mail-complaints-to="usenet@i2pn2.org";
	posting-account="diqKR1lalukngNWEqoq9/uFtbkm5U+w3w6FQ0yesrXg";
User-Agent: Mozilla Thunderbird
X-Spam-Checker-Version: SpamAssassin 4.0.0
Content-Language: en-US
In-Reply-To: <vpd0lb$irt$7@dont-email.me>
Bytes: 7018
Lines: 133

On 2/22/25 12:14 PM, olcott wrote:
> On 2/22/2025 6:20 AM, Richard Damon wrote:
>> On 2/21/25 11:44 PM, olcott wrote:
>>> On 2/21/2025 7:05 PM, Richard Damon wrote:
>>>> On 2/21/25 6:19 PM, olcott wrote:
>>>>> On 2/20/2025 2:54 AM, Mikko wrote:
>>>>>> On 2025-02-18 03:59:08 +0000, olcott said:
>>>>>>
>>>>>>> On 2/12/2025 4:21 AM, Mikko wrote:
>>>>>>>> On 2025-02-11 14:07:11 +0000, olcott said:
>>>>>>>>
>>>>>>>>> On 2/11/2025 3:50 AM, Mikko wrote:
>>>>>>>>>> On 2025-02-10 11:48:16 +0000, olcott said:
>>>>>>>>>>
>>>>>>>>>>> On 2/10/2025 2:55 AM, Mikko wrote:
>>>>>>>>>>>> On 2025-02-09 13:10:37 +0000, Richard Damon said:
>>>>>>>>>>>>
>>>>>>>>>>>>> On 2/9/25 5:33 AM, Mikko wrote:
>>>>>>>>>>>>>> Of course, completness can be achieved if language is 
>>>>>>>>>>>>>> sufficiently
>>>>>>>>>>>>>> restricted so that sufficiently many arithemtic truths 
>>>>>>>>>>>>>> become inexpressible.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> It is far from clear that a theory of that kind can 
>>>>>>>>>>>>>> express all arithmetic
>>>>>>>>>>>>>> truths that Peano arithmetic can and avoid its incompletness.
>>>>>>>>>>>>>
>>>>>>>>>>>>> WHich, it seems, are the only type of logic system that 
>>>>>>>>>>>>> Peter can understand.
>>>>>>>>>>>>>
>>>>>>>>>>>>> He can only think in primitive logic systems that can't 
>>>>>>>>>>>>> reach the complexity needed for the proofs he talks about, 
>>>>>>>>>>>>> but can't see the problem, as he just doesn't understand 
>>>>>>>>>>>>> the needed concepts.
>>>>>>>>>>>>
>>>>>>>>>>>> That would be OK if he wouldn't try to solve problems that 
>>>>>>>>>>>> cannot even
>>>>>>>>>>>> exist in those systems.
>>>>>>>>>>>
>>>>>>>>>>> There are no problems than cannot be solved in a system
>>>>>>>>>>> that can also reject semantically incorrect expressions.
>>>>>>>>>>
>>>>>>>>>> The topic of the discussion is completeness. Is there a 
>>>>>>>>>> complete system
>>>>>>>>>> that can solve all solvable problems?
>>>>>>>>>
>>>>>>>>> When the essence of the change is to simply reject expressions
>>>>>>>>> that specify semantic nonsense there is no reduction in the
>>>>>>>>> expressive power of such a system.
>>>>>>>>
>>>>>>>> The essence of the change is not sufficient to determine that.
>>>>>>>
>>>>>>> In the same way that 3 > 2 is stipulated the essence of the
>>>>>>> change is that semantically incorrect expressions are rejected.
>>>>>>> Disagreeing with this is the same as disagreeing that 3 > 2.
>>>>>>
>>>>>> That 3 > 2 need not be (and therefore usually isn't) stripualted.
>>>>>
>>>>> The defintion of the set of natural numbers stipulates this.
>>>>>
>>>>>> It follows from the traditional meanings of "3", "2", and ">".
>>>>>> Therefore the above statement is meaningless.
>>>>>>
>>>>>>>> The
>>>>>>>> result depends on all of the change. But as long as we don't even
>>>>>>>> know whether that kind of change is possible at all the details are
>>>>>>>> impossible to determine.
>>>>>>>
>>>>>>> LP := ~True(LP) has never been more than nonsense.
>>>>>>
>>>>>> More specifically, your nonnsense. The symbol ":=" usually means 
>>>>>> definition
>>>>>> but requires that the symbol on the left side (in this case "LP") 
>>>>>> is not
>>>>>> used on the right side (and also that it is not used in the 
>>>>>> definition of
>>>>>> any of the symbols on the right side).
>>>>>>
>>>>>> Usually languages of formal logic are constructed so that symbol 
>>>>>> that is
>>>>>> defined with an expression that starts with a negation operator 
>>>>>> cannot
>>>>>> be used as an argument to a function or a predicate.
>>>>>>
>>>>>>> Tarski (although otherwise quite brilliant) had a blind spot.
>>>>>>
>>>>>> Tarski did not use your nonsense.
>>>>>>
>>>>>
>>>>> Tarski anchored his whole proof in the Liar Paradox.
>>>>>
>>>>
>>>> By showing that given the necessary prerequisites, The equivalent of 
>>>> the Liar Paradox was a statement that the Truth Predicate had to be 
>>>> able to handle, which it can't.
>>>>
>>>
>>> It can be easily handled as ~True(LP) & ~True(~LP), Tarski just
>>> didn't think it through. The limitations of logic systems is that
>>> they try to unsuccessfully simply assume that every expression
>>> of language <is> a truth bearer. These systems cannot think outside
>>> of that box.
>>>
>>
>> Nope.
>>
>> It is YOU that can't handle logic,
>>
>> What VALUE does True(LP) have?
>>
> 
> *As I already said*
>  >> ~True(LP) & ~True(~LP)
> In other words:
> 
>   True(LP) == false
> True(~LP) == false
> 

That is nonsense.

If True(LP) is FALSE, the LP, which is the negation of that is True.

And thus your True function says that a true statement is false.

Note, I never talked about ~LP, just about LP

Of course, since LP is defined in relationship to the True Predicate, LP 
and ~LP can not both be false unless you admit that your predicate is 
just nonsense.

Sorry, you are just proving your inability to think and form meaningful 
sentences, and just claim stuff that is nonsense.