Path: ...!news.mixmin.net!news2.arglkargh.de!news.karotte.org!news.space.net!news.muc.de!.POSTED.news.muc.de!not-for-mail From: Alan Mackenzie Newsgroups: comp.theory Subject: Re: Formal systems that cannot possibly be incomplete except for unknowns and unknowable Date: Mon, 5 May 2025 18:52:29 -0000 (UTC) Organization: muc.de e.V. Message-ID: References: MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: quoted-printable Injection-Date: Mon, 5 May 2025 18:52:29 -0000 (UTC) Injection-Info: news.muc.de; posting-host="news.muc.de:2001:608:1000::2"; logging-data="48696"; mail-complaints-to="news-admin@muc.de" User-Agent: tin/2.6.4-20241224 ("Helmsdale") (FreeBSD/14.2-RELEASE-p1 (amd64)) Bytes: 2073 Lines: 35 olcott wrote: > On 5/5/2025 1:19 PM, Alan Mackenzie wrote: >> olcott wrote: >>> On 5/5/2025 11:05 AM, Alan Mackenzie wrote: [ .... ] >>>> Follow the details of the proof of G=C3=B6del's Incompleteness Theor= em, and >>>> apply them to your "system". That will give you your counter exampl= e. >>> My system does not do "provable" instead it does "provably true". >> I don't know anything about your "system" and I don't care. If it's a >> formal system with anything above minimal capabilities, G=C3=B6del's T= heorem >> applies to it, and the "system" will be incomplete (in G=C3=B6del's se= nse). > I reformulate the entire notion of "formal system" > so that undecidability ceases to be possible. Liar. That is impossible. [ Irrelevant nonsense snipped. ] > --=20 > Copyright 2024 Olcott "Talent hits a target no one else can hit; Genius > hits a target no one else can see." Arthur Schopenhauer --=20 Alan Mackenzie (Nuremberg, Germany).