Path: ...!news.misty.com!weretis.net!feeder9.news.weretis.net!i2pn.org!i2pn2.org!.POSTED!not-for-mail
From: Richard Damon <richard@damon-family.org>
Newsgroups: sci.logic,comp.theory
Subject: Re: True on the basis of meaning
Date: Fri, 10 May 2024 23:16:35 -0400
Organization: i2pn2 (i2pn.org)
Message-ID: <v1mnuj$lbo5$12@i2pn2.org>
References: <v1mljr$1q5ee$4@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 7bit
Injection-Date: Sat, 11 May 2024 03:16:35 -0000 (UTC)
Injection-Info: i2pn2.org;
	logging-data="700165"; mail-complaints-to="usenet@i2pn2.org";
	posting-account="diqKR1lalukngNWEqoq9/uFtbkm5U+w3w6FQ0yesrXg";
User-Agent: Mozilla Thunderbird
In-Reply-To: <v1mljr$1q5ee$4@dont-email.me>
X-Spam-Checker-Version: SpamAssassin 4.0.0
Content-Language: en-US
Bytes: 1689
Lines: 19

On 5/10/24 10:36 PM, olcott wrote:
> The entire body of expressions that are {true on the basis of their
> meaning} involves nothing more or less than stipulated relations between
> finite strings.
> 

You do know that what you are describing when applied to Formal Systems 
are the axioms of the system and the most primitively provable theorems.


You don't seem to understand what "Formal Logic" actually means.

You also don't seem to understand the requirements of "Context" when 
applying the meaning of the words.

For instance, in Computation Theory, the only simulation that can be 
used to determine behavior are non-aborted simulations, so that is the 
only sort of simulation actually considered to be a normal simulation.

Of course, that blows up your ideas.