Sujet : Re: Formal systems that cannot possibly be incomplete except for unknowns and unknowable
De : acm (at) *nospam* muc.de (Alan Mackenzie)
Groupes : comp.theoryDate : 05. May 2025, 19:52:29
Autres entêtes
Organisation : muc.de e.V.
Message-ID : <vvb1dd$1fho$3@news.muc.de>
References : 1 2 3 4 5 6 7
User-Agent : tin/2.6.4-20241224 ("Helmsdale") (FreeBSD/14.2-RELEASE-p1 (amd64))
olcott <
polcott333@gmail.com> wrote:
On 5/5/2025 1:19 PM, Alan Mackenzie wrote:
olcott <polcott333@gmail.com> wrote:
On 5/5/2025 11:05 AM, Alan Mackenzie wrote:
[ .... ]
Follow the details of the proof of Gödel's Incompleteness Theorem, and
apply them to your "system". That will give you your counter example.
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ödel's Theorem
applies to it, and the "system" will be incomplete (in Gödel's sense).
I reformulate the entire notion of "formal system"
so that undecidability ceases to be possible.
Liar. That is impossible.
[ Irrelevant nonsense snipped. ]
--
Copyright 2024 Olcott "Talent hits a target no one else can hit; Genius
hits a target no one else can see." Arthur Schopenhauer
-- Alan Mackenzie (Nuremberg, Germany).
…