Liste des Groupes | Revenir à s logic |
On 3/16/2025 5:50 PM, Richard Damon wrote:Sure he did, because he can create an expression x that it can not handle.On 3/16/25 11:12 AM, olcott wrote:A True(X) predicate can be defined and Tarski neverOn 3/16/2025 7:36 AM, joes wrote:>Am Sat, 15 Mar 2025 20:43:11 -0500 schrieb olcott:>>That does not disprove Tarski.
We can define a correct True(X) predicate that always succeeds except
for unknowns and untruths, Tarski WAS WRONG !!!
>
He said that this is impossible and no
counter-examples exists that shows that I am wrong.
True(GC) == FALSE Cannot be proven true AKA unknown
True(LP) == FALSE Not a truth-bearer
>
>
But if x is what you are saying is
showed that it cannot.
True(X) only returns TRUE when a a sequence of truthRight, so for the x that is true if and only if True(x) is false that he constructs in the language using properties created in a metalangugage that knows the langugage, What does True(x) return?
preserving operations can derive X from the set of basic
facts and returns false otherwise.
This never fails on the entire set of human generalBecause the entire set of human general knowledge isn't a formal logic system, and can't really be made into one.
knowledge that can be expressed using language.
It is not fooled by pathological self-reference orSure it was, otherwise, what value should it have returned for that True(x)?
self-contradiction.
Les messages affichés proviennent d'usenet.