Forums before death by AOL, social media and spammers... "We can't have nice things"
|    sci.lang    |    Natural languages, communication, etc    |    297,461 messages    |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
|    Message 297,101 of 297,461    |
|    olcott to Mikko    |
|    Re: Defeating the Tarski Undefinability     |
|    05 Oct 25 09:03:37    |
      [continued from previous message]              >>>>>> a truth bearer. It is true that X is not true.       >>>>>       >>>>> You cannot say that in the plain language of logic. You need a       >>>>> metatheory that can express and infer about expressions and       >>>>> relate them to truth.       >>>>       >>>> I proved otherwise       >>>> https://claude.ai/share/45d3ca9c-fa9a-4a02-9e22-c6acd0057275       >>>       >>> You didn't prove anything. If you could you would post here the       >>> plain logic sentence that says what you said.       >>       >> It explains a correction to an aspect of the       >> foundation of logic and it does this in plain       >> English and a tiny bit of Prolog.       >       > It is not correct to use the word "correction" when the thing to       > be corrected is correct already.       >              Gödel 1931 undecidability and Tarski Undefinability       only exist because they they not know to reject an       expression of language that is not a truth bearer.              Claude AI is quite hesitant at first, disagreeing       with me several times. Then it is finally convinced       that I am correct.              >>> But Tarski proved about natural numbers that if there were a definition       >>> of a predicate in terms of a formula in the language of Peano arithmetic       >>> that accepts all numbers that encode a true sentence and rejects all       >>> other numbers then that predicate would accept a number that encodes       >>> a false sentence or reject a number that encodes a true sentence.       >>       >> Mine has a broader scope that can be applied to       >> any pathological self-reference(Olcott 2004) in       >> formal expressions and formalized natural language       >> expressions.       >       > Tarstki's scope is wider, too, but the first order arithmetic of natural       > numbers is the most interesting part of the scope.       >              My scope is the entire body of human knowledge       that can be expressed in language.              --       Copyright 2025 Olcott "Talent hits a target no one else can hit; Genius       hits a target no one else can see." Arthur Schopenhauer              --- SoupGate-Win32 v1.05        * Origin: you cannot sedate... all the things you hate (1:229/2)    |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
(c) 1994, bbs@darkrealms.ca