Originally posted by phoenixthoth
hurkyl, that's exactly the example i was going to give.
if every statement is either true or false, then tell me whether the following statements are true or false, ok?
1. i am tall (i'm 5'11'')
2. i am very tall
3. i am somewhat tall
4. i am roughly of average height
5. i am beautiful
6. i am one of the most beautiful people in the world
7. i always lie
8. this statement is false
9. the barber who shaves every man who doesn't shave himself shaves himself
10. the barber who shaves every man who doesn't shave himself does not shave himself
11. the set of all sets that are not members of itself is a member of itself.
12. the set of all sets that are not members of itself is not a member of itself.
13. this statement is true but not provable.
14. this statement is true but you can prove that it is false.
or did you just mean that all well formed formula in binary logic are either true or false?
this is the third thread with basically the same topic now.
There is a difference between a sentence and a statement. A statement must either be true or false, and no statement can be true and false simultaneously. Now, in order to have truth value, a statement must have meaning. Consider the sentence, "I am tall". It is neither true nor false, hence it isn't a statement. Now, you could try to define 'tall' using ruler measurement, and say that such and such is tall if and only if its length is greater than the length of this ruler, but clearly if you feel these sentences are paradoxes of some kind, then that isn't what you mean by the adjective 'tall'. Thus, all your sentences which involve the word 'tall' are not statements. The same goes four the fourth sentence. The word 'beautiful' is also meaningless.
As for the sentence "I always lie", simple statement mechanics reveal things to you. Suppose the sentence is a statement. Next suppose it is true. Now, we need to know what it means. Suppose that it is assigned a meaning such that if it is true then it is false. It will now follow that the statement which the sentence denotes is false. Before you can assess the truth value though, the meaning of the sentence must be clear. If the meaning of the sentence isn't clear, then the sentence is meaningless, and hence cannot denote a statement.
X = this statement is false = X is a statement AND |X|=0
Suppose X is a statement.
Suppose |X|=1. Therefore, |X|=0 and |X|=1, therefore 0=1, which is false. Hence not (|X|=1), hence |X|=0. Thus, not (X is a statement) or not (|X|=0). Hence, X isn't a statement or |X|=1. And we know that not (|X|=1), hence X isn't a statement.
All your other sentences are completely analyzable using binary logic. What must happen is this. The sentences which are statements are true or false but not both simultaneously, and the rest of the sentences arent statements.
Consider the sentence:
the barber who shaves every man who doesn't shave himself shaves himself
Suppose the barber exists.
Now, it is asserted that for any man in town, if that man does not shave himself then the barber shaves that man AND the barber shaves himself.
Let B denote the barber, let S denote the binary relation 'shaves' and let X denote an arbitrary man from the town. The sentence is asserting that:
For any X, if not (X-S-X) then (B-S-x)
The previous sentence is a first order logical statement, and the domain of discourse is the set of men in some town. Supppose that B is an element of the set of men in this town, then B is substitutable for X, which leads to the following statement:
if not (B-S-B) then (B-S-B), which can be shown to be tautologically equivalent to
B-S-B
Now, we can eliminate the assumption that the barber is a man in this town, and right the following absolutely true statement:
Either the barber is not a man in this town, or the baber shaves himself. It was also asserted that the barber shaves himself, and this does not contradict any of the reasoning.
In 10 however, we would reach a contradiction by getting the compounnd statement B-S-B and not(B-S-B) from which it follows that the barber is not a man in the town, still no paradox at all.
11 and 12 mimic 9,10
13,14 if statements, are compound statements which assert they are statements, and in that sense they are similar to sentence 8. The error in the Godel theorem is that the sentence isn't a statement, but is processed as a statement. The break in reasoning should occur by concluding that the sentence isn't a statement.