Fuzzy logic and the Liar paradox

nomadreid
Gold Member
Messages
1,748
Reaction score
243
I have once again (this time in http://www.economist.com/node/2099851) come across the argument that a fuzzy logic solves the liar paradox by assigning the liar sentence a truth value N, other than T or F, with
[[A]] = N ⇒[[~A]] = N. However, I don't see that this gets around the essential point of the liar: the liar uses a predicate ~T, and the assumption of the existence of a predicate ~T leads to a contradiction, for example quickly with the Diagonal Lemma. So if you could build the liar sentence, then the fuzzy logic would be of use to not make it a paradox, granted, but you can't even build the liar sentence in the first place. What am I missing?
 
Physics news on Phys.org
Here's the arxiv preprint of the paper that the Economist article refers to:

http://arxiv.org/pdf/cs/0309046v1.pdf

I haven't read the whole thing in depth, but basically, they look at specific instances of "The truth value of B is b." At the first level, you have a set of propositions B∈S1, which can be assigned a certain truth value Tr(B) (N.B.--in fuzzy logic, Tr(B)∈[0,1]; cf. Boolean logic, where Tr(B)∈{0,1}), and at the second level you have the set of statements C∈S2 about the truth value of B, namely C = "Tr(B) = b." [It's important to note that S2⊆S1.] Of course, Tr(B) is independent of b, but our intuition says that C is true when Tr(B) is actually equal to b and false when Tr(B) and b differ by exactly 1. So they define Tr(C) = 1-|Tr(B)-b|.

The tricky part comes when you have a self-referential formula, like B = "Tr(B) = b." The authors model the Liar sentence as A = "A is false," or A = "Tr(A) = 0," where A∈S1. But since A is of the same form as C (above), it's also the case that A∈S2. So the sentence can be recast as C = "Tr(A) = 0." Since A=C, we also have Tr(A)=Tr(C). Taking the definition of Tr(C), you get:

Tr(C) = 1-|Tr(C)-0| = 1-Tr(C) since Tr(C) ≥ 0
2Tr(C) = 1
Tr(C) = 0.5

Whether you agree with it philosophically or not, it does seem to be a consistent way to treat the problem. But it hinges on two things: how you model the Liar sentence, and how you define the truth value of sentences from the set S2.
 
Last edited:
  • Like
Likes nomadreid
Many thanks, TeethWhitener, both for the article and your excellent summary! Fascinating article, not only the part that you so splendidly summarized, but the rest of it as well. I am still going through it, but the essential part which you explained is indeed rather elegant: a bit like having nested models reflected down to a single syntactic level. Philosophically? I do not see any philosophical objection problem with breaking a truth value assignment into two parts. More of interest are the open questions which the author leaves "for future research", especially: is the set of solutions the base set for a lattice? Thanks again!
 
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Thread 'Detail of Diagonalization Lemma'
The following is more or less taken from page 6 of C. Smorynski's "Self-Reference and Modal Logic". (Springer, 1985) (I couldn't get raised brackets to indicate codification (Gödel numbering), so I use a box. The overline is assigning a name. The detail I would like clarification on is in the second step in the last line, where we have an m-overlined, and we substitute the expression for m. Are we saying that the name of a coded term is the same as the coded term? Thanks in advance.
Back
Top