Re: This makes all Analytic(Olcott) truth computable

On 2024-08-19 12:42:50 +0000, olcott said:

On 8/19/2024 2:59 AM, Mikko wrote:

On 2024-08-18 12:12:48 +0000, olcott said:
 

On 8/18/2024 5:14 AM, Mikko wrote:

On 2024-08-16 18:11:46 +0000, olcott said:
 

On 8/16/2024 11:32 AM, Richard Damon wrote:

On 8/16/24 7:02 AM, olcott wrote:

 *This abolishes the notion of undecidability*
As with all math and logic we have expressions of language
that are true on the basis of their meaning expressed
in this same language. Unless expression x has a connection
(through a sequence of true preserving operations) in system
F to its semantic meanings expressed in language L of F
x is simply untrue in F.

 But you clearly don't understand the meaning of "undecidability"

 Not at all. I am doing the same sort thing that ZFC
did to conquer Russell's Paradox.

 Zermelo constructed a new formal theory that does not have that paradox.
Note that the paradox was not present in Cantor's original theory as
Cantor did not promise that Russell's set exists. But Cantor's original
presentation was not fully formal so it was not clear that Russell's
set does not exist.
 

 I am redefining the notion of a formal system to get
rid of undecidability. This requires few changes.

 Put a draft and a request for discussion on a web site.
 

 I post here to establish my priority date for intellectual
property purposes. Websites can go out-of-business.

Nobody promises that posted messaged are stored forever. News servers
are not eternal and the whole Usenet is slowly going down. Much of
its functionality has already moved to more modern platforms. For
exampl, sci.logic was originally intended and actually used for serious
discussion about logic and related things. Now it is mainly about false
ideas about logic and related and unrelated things.
--
Mikko