Deutsch   English   Français   Italiano  
<b47c9e70d415c1e5e469aaab846f0bd05e4bcc51@i2pn2.org>

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

Path: news.eternal-september.org!eternal-september.org!feeder3.eternal-september.org!news.quux.org!news.nk.ca!rocksolid2!i2pn2.org!.POSTED!not-for-mail
From: Richard Damon <richard@damon-family.org>
Newsgroups: sci.logic,comp.theory
Subject: Re: Formal systems that cannot possibly be incomplete except for
 unknowns and unknowable
Date: Mon, 5 May 2025 07:04:15 -0400
Organization: i2pn2 (i2pn.org)
Message-ID: <b47c9e70d415c1e5e469aaab846f0bd05e4bcc51@i2pn2.org>
References: <vv97ft$3fg66$1@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 7bit
Injection-Date: Mon, 5 May 2025 11:32:09 -0000 (UTC)
Injection-Info: i2pn2.org;
	logging-data="3229673"; mail-complaints-to="usenet@i2pn2.org";
	posting-account="diqKR1lalukngNWEqoq9/uFtbkm5U+w3w6FQ0yesrXg";
User-Agent: Mozilla Thunderbird
X-Spam-Checker-Version: SpamAssassin 4.0.0
Content-Language: en-US
In-Reply-To: <vv97ft$3fg66$1@dont-email.me>

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.

> 
> The language of such a formal system is an extended form of the Montague 
> Grammar of natural language semantics. I came up with this mostly in the 
> last two years. I have been working on it for 22 years.
> 
> The Montague Grammar Rudolf Carnap Meaning postulates are organized in a 
> knowledge ontology inheritance hierarchy. https://en.wikipedia.org/wiki/ 
> Ontology_(information_science)

And the problem is that either your claim is wrong, or your logic system 
is just shown to be too small to be useful for many of the things we 
want to be able to do because it can't support the mathematics of 
Natural Numbers.

You don't seem to understand that all the properties you don't like 
about Logic Systems are all conditioned on the ability for the system to 
have a certain level of power in their ability to do logic. "Tpy" 
systems that have been limited below that level will not experiance the 
problems, but also are too weak to do the problems we typically want to 
do with logic.

This ultimate shows your fundamental misunderstanding of what you are 
talking about, especially your inability to handle abstractions, and 
things that can create "infinities".