Sujet : Re: Formal systems that cannot possibly be incomplete except for unknowns and unknowable
De : polcott333 (at) *nospam* gmail.com (olcott)
Groupes : sci.logic comp.theoryDate : 06. May 2025, 05:27:29
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <vvc33h$25atc$1@dont-email.me>
References : 1 2 3
User-Agent : Mozilla Thunderbird
On 5/5/2025 10:31 AM, olcott wrote:
On 5/5/2025 6:04 AM, Richard Damon wrote:
On 5/4/25 10:23 PM, olcott 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.
>
Can such a system include the mathematics of the natural numbers?
>
If so, your claim is false, as that is enough to create that undeciability.
>
It seems to me that the inferences steps that could
otherwise create undecidability cannot exist in the
system that I propose.
The mathematics of natural numbers (as I have already explained)
begins with basic facts about natural numbers and only applies
truth preserving operations to these basic facts.
When we begin with truth and only apply truth preserving
operations then WE NECESSARILY MUST END UP WITH TRUTH.
When we ALWAYS end up with TRUTH then we NEVER end up with UNDECIDABILITY.
Its not that hard, iff you pay enough attention.
-- Copyright 2024 Olcott "Talent hits a target no one else can hit; Geniushits a target no one else can see." Arthur Schopenhauer
…