Liste des Groupes | Revenir à s logic |
On 3/9/25 4:08 PM, olcott wrote:"the antinomy of the liar in the metalanguage"On 3/9/2025 2:24 PM, Richard Damon wrote:Note, he says to construct the antinomy of the liar in the METALANGUAGE representing the statement x in the LANGUAGE. Thus "x" is *NOT* the liar, but something that with the additional information of the metalanguage can be reduced to it.On 3/9/25 1:15 PM, olcott wrote:>Is the Liar Paradox True or False?>
>
LP := ~True(LP)
>
?- LP = not(true(LP)).
LP = not(true(LP)).
>
?- unify_with_occurs_check(LP, not(true(LP))).
false.
>
Its infinitely recursive structure makes it neither true nor false.
>
>
The liar's paradox isn't an "undecidable" instance, as "undecidable" is about a problem that has a true or false answer that can not be computed for every case.
>
Tarski thought that is was undecidable and anchored his
whole proof in it.
>
Tarski's Liar Paradox from page 248
It would then be possible to reconstruct the antinomy of the liar
in the metalanguage, by forming in the language itself a sentence
x such that the sentence of the metalanguage which is correlated
with x asserts that x is not a true sentence.
https://liarparadox.org/Tarski_247_248.pdf
Les messages affichés proviennent d'usenet.