In summary, my problem is why nobody interprets the statement "All sentences are false" as "All sentences are false and this very sentence is false", because in this version the whole thing wouldn't be true or false. I just don't see an error in infering one from the other. — Pippen
You can make the inference if you like, but the second version
is also false, as I showed a month ago. I'll do it again:
Let S be "S is false and all statements are false".
Now we try assigning truth values to S to see if it is possible for S to be true or false. We may find that it must be assigned the value "true" in all models of English (that it is a tautology), that it must be assigned the value "false" in all models (that it is a contradiction), or that it can be true in some models and false in others, like most statements, or that it cannot be assigned a truth value in any model (like the Liar).
1. Assume S is true.
2. If S is true, then both conjuncts are true.
3. If both conjuncts are true, then the first is true, so it is is true that S is false.
This is contradiction, because at the moment we are assuming S is true. So there are no models of English in which S is true. But perhaps S is not false either, as you claim.
4. Assume S is false.
5. If S is false, then at least one of the conjuncts is false.
We now try each conjunct in turn. First conjunct:
6. Assume it is false that S is false.
7. If it is false that S is false, then S is true.
But we assumed in (4) that S is false, so this is a contradiction; thus there are no models of English in which S is false and its first conjunct is false. Second conjunct:
7. Assume it is false that all statements are false.
Here at last we have a possible truth-value assignment that doesn't immediately produce a contradiction. Thus all models of English must assign truth values this way: S is false (our assumption 4) and it is the second conjunct that is false, so it is also false that all statements are false. This is the only possible way to assign truth values without the model contradicting itself.
Your view I think is something like this: the usual way of determining whether a conjunction is a tautology, a contradiction, contingently true or false, or just not truth-apt at all, is to assign all possible truth-value combinations to the conjuncts and use a little truth table to see how the conjunction comes out. An arbitrary P & Q is
T & T : T
T & F : F
F & T : F
F & F : F
so it could be either true or false. On the other hand, P & ~P goes like this:
T & F : F
F & T : F
It's always false. So you're thinking that since you have, in essence, "[the Liar] & P" as your conjunction, we'll be unable to construct a truth table because the first conjunct is not truth-apt. True.
But conjunction is a short circuit with respect to falsehood, as disjunction is with respect to truth. If we can establish that one of a pair of conjuncts is false, we are never forced to evaluate the other conjunct to know that the conjunction as a whole is false. In my version, I never do assign a truth value to the first conjunct, but it doesn't matter. In essence we end up treating it as a pseudo-conjunction: blah-blah-blah P, and P happens to be a contradiction.
So we could skip most of the steps above and go that way instead. We show that "All statements are false" can only be false, which you agree to, and then short-circuit any conjunction it appears in.
I claim this is reasonable because whether to count some string of English words as a statement at all, as truth-apt, is up to us. There is no formal system on offer here to tell us whether some string is or isn't well-formed. We can rule out anything we like, but we can only rule in strings we can successfully assign a truth value to. We can't rule in the Liar. But we can rule in "All statements are false" by calling it always false, and we can rule in "This statement is false and all statements are false" by calling it always false. We're not compelled to, but we can.
ADDED: I would claim further that this approach is reasonable precisely on the grounds that we would ordinarily expect "All statements are false" and "This statement is false and all (other) statements are false" to be equivalent.
Your version has a truth-apt statement being equivalent to the Liar. If we can avoid that, we ought.
AND STILL MORE: Note that short-circuiting is consistent: "Dinosaurs are extinct" is contingently true; there are possible models in which it is false. But "Dinosaurs are extinct and all statements are false" is always false. "It's raining or it's not, and all statements are false" is always false, even though "It's raining or it's not" is always true.