Sujet : Re: True on the basis of meaning
De : richard (at) *nospam* damon-family.org (Richard Damon)
Groupes : sci.logic comp.theoryDate : 11. May 2024, 04:16:35
Autres entêtes
Organisation : i2pn2 (i2pn.org)
Message-ID : <v1mnuj$lbo5$12@i2pn2.org>
References : 1
User-Agent : Mozilla Thunderbird
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.