Sujet : Re: Formal systems that cannot possibly be incomplete except for unknowns and unknowable
De : acm (at) *nospam* muc.de (Alan Mackenzie)
Groupes : sci.logic comp.theorySuivi-à : comp.theoryDate : 05. May 2025, 11:47:54
Autres entêtes
Organisation : muc.de e.V.
Message-ID : <vva50q$24vr$1@news.muc.de>
References : 1
User-Agent : tin/2.6.4-20241224 ("Helmsdale") (FreeBSD/14.2-RELEASE-p1 (amd64))
[ Followup-To: set ]
In comp.theory olcott <
polcott333@gmail.com> wrote:
When we define formal systems as a finite list of basic facts and allow
semantic logical entailment as the only rule of inference we have
systems that can express any truth that can be expressed in language.
Also with such systems Undecidability is impossible. The only
incompleteness are things that are unknown or unknowable.
Do you believe in the tooth fairy, too?
[ .... ]
--
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).
Formal systems that cannot possibly be incomplete except for unknowns and unknowable
Re: Formal systems that cannot possibly be incomplete except for unknowns and unknowable