Warning: mysqli::__construct(): (HY000/1203): User howardkn already has more than 'max_user_connections' active connections in D:\Inetpub\vhosts\howardknight.net\al.howardknight.net\includes\artfuncs.php on line 21
Failed to connect to MySQL: (1203) User howardkn already has more than 'max_user_connections' active connections
Warning: mysqli::query(): Couldn't fetch mysqli in D:\Inetpub\vhosts\howardknight.net\al.howardknight.net\index.php on line 66
Article <vpc4iq$3snkm$1@dont-email.me>
Deutsch   English   Français   Italiano  
<vpc4iq$3snkm$1@dont-email.me>

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

Path: news.eternal-september.org!eternal-september.org!.POSTED!not-for-mail
From: Mikko <mikko.levanto@iki.fi>
Newsgroups: sci.logic
Subject: Re: Mathematical incompleteness has always been a misconception --- Tarski
Date: Sat, 22 Feb 2025 11:15:06 +0200
Organization: -
Lines: 82
Message-ID: <vpc4iq$3snkm$1@dont-email.me>
References: <vnh0sq$35mcm$1@dont-email.me> <vni4ta$3ek8m$1@dont-email.me> <vnikre$3hb19$1@dont-email.me> <vnkov9$1971$1@dont-email.me> <vnl9vj$4f8i$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>
MIME-Version: 1.0
Content-Type: text/plain; charset=utf-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Sat, 22 Feb 2025 10:15:07 +0100 (CET)
Injection-Info: dont-email.me; posting-host="4df74daf15fbfe0d476e68127d2850c6";
	logging-data="4087446"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX1+YwfHb+wVxBf+f4P/6pynU"
User-Agent: Unison/2.2
Cancel-Lock: sha1:C1K3Fh2IEkbcoIEtEF0p4Ph7j8s=

On 2025-02-21 23:19:10 +0000, olcott said:

> 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.

More specifically, to the idea that the Liar Paradox does not have a
truth value. Do you reject that idea?

-- 
Mikko