In my previous post I discussed the liar paradox and argued that it should not be considered either true or false because it is cyclic. That is, it never ends up successfully asserting anything about the world.
Interestingly, the Stanford Encyclopedia of Philosophy (SEP) entry for the Liar Paradox outlines an argument that the liar sentence implies a contradiction. The argument uses two inference rules, as follows:
- Capture: A implies "A" is true
- Release: "A" is true implies A
Taking these two rules together, the terms A and "A" is true are intersubstitutable [1]. The SEP argument, reproduced in plain English [2], is:
Let L be the sentence, "This sentence is not true".
2. Case One:
a. "L" is true
b. L [2a: release]
c. "L" is not true [2b: definition of L]
d. "L" is true and "L" is not true [2a, 2c: conjunction introduction]
3. Case Two:
a. "L" is not true
b. L [3a: definition of L]
c. "L" is true [3b: capture]
d. "L" is true and "L" is not true [3a, 3c: conjunction introduction]
4. "L" is true and "L" is not true [1-3: disjunction elimination]
Line 1 assumes that the liar sentence conforms to the Law of Excluded Middle. That is, it assumes that the liar sentence is either true or not true and not some other value. Lines 2 and 3 analyze each disjunct as separate cases. In each case a contradiction is reached which is then inferred in 4.
The conclusion that the liar sentence implies a contradiction depends on the first premise being truth-apt. However, as argued previously, the liar sentence is not truth-apt and so therefore the first premise can't be either. Consequently logical inference rules and truth evaluation aren't applicable to it. A contradiction is only reached via a false assumption of truth-aptness.
The rule of thumb would be that a sentence is only truth-apt if it is grounded in a state of the world either directly or else indirectly via other sentences. Note that this condition fails for both the simple liar (where not true means false) and the strengthened liar (where not true means false or not truth-apt).
--
[1] This is Alfred Tarski's T-Schema: 'S' is true if and only if S (e.g., 'snow is white' is true if and only if snow is white).
[2] For example, I've replaced the corner symbols that indicate quasi-quotation with ordinary quotes.
No comments:
Post a Comment