This question has already been asked here twice, namely here and here, but none of the answers address my specific question, except probably for this answer, which comes close.
So, using the notation of the close answer, I don't understand why I have to rule out the tuples $(T,T)$ and $(F,F)$.
Let's call the sentence "Q is necessary but not sufficient for P" R.
As for $(F,F)$, if P is false when Q is also false, this should result in R = true; since Q is necessary for P, so the absence of Q should imply the absence of P. Why would I want R to be false in this case?
And for $(T,T)$, I will imagine a more complete picture. Let's say that P depends on Q and some other factors, collectively named W. Now, we should split the row $(T,T)$ into 2, one with W false, and another with W true. In the case with W true, R should evaluate to T, and in the case with W false, R should evaluate to false. On what basis, then, should we decide to rule out $(T,T)$ in the original statement! In my opinion, the row with $(T,T)$ should be undecidable.
I would be grateful if someone could explain to my why the correct answer is $¬(¬r∧¬p)→¬q∧¬((¬r∧¬p)→q)$ in a way other that
"is necessary" translates to so and so and "is sufficient" translates
to so and so, so the conjunction of the first with the negation of the
second gives the correct answer.
Thanks
Best Answer
The statement "$P$ is necessary for $Q$" means "in order to have $Q$, we must have $P$" or $Q \to P$, though we can also write the contrapositive $\neg P \to \neg Q$.
The statement "$P$ is sufficient for $Q$" means "if we have $P$, we definitely have $Q$" or $P \to Q$, though we can also write the contrapositive $\neg Q \to \neg P$.
So, the statement "$P$ is necessary but not sufficient for $Q$" can be written as $$(\neg P \to \neg Q) \land \neg (P \to Q).$$ In the example you've given, $Q = q$ while $P = \neg r \land \neg p$ due to specifics of the other question, and if we substitute those for $P$ and $Q$, we get the statement you're quoting.
If you look at the logical statement carefully, it turns out that $(\neg P \to \neg Q) \land \neg (P \to Q)$ is only true in one case: when $P$ is true, but $Q$ is false. Why is that? Because in order to observe $P$ not being sufficient for $Q$, $P$ has to happen, and $Q$ has to still fail to happen.
This doesn't match our intuitions for what "$P$ is necessary but not sufficient for $Q$" means. We want to say something like:
To say things like this, the language of logical statements doesn't suffice! We have to have quantifiers for talking about "some cases" and "all cases".
Let $P(x)$ and $Q(x)$ denote "in case $x$, $P$ holds" and "in case $x$, $Q$ holds". Then:
The statement "$P$ is necessary but not sufficient for $Q$" has the more sophisticated interpretation $$ (\forall x\, Q(x) \to P(x)) \land (\exists x\, P(x) \land \neg Q(x)). $$ That is: "In all cases $x$ where $Q(x)$ holds, $P(x)$ also holds. However, there is a case where $P(x)$ holds, but $Q(x)$ does not".
A bare statement like $P(x) \land Q(x)$ is neither true nor false, because $x$ isn't quantified. The universal statement $\forall x\, P(x) \land Q(x)$ is false (because otherwise, $P$ would be sufficient for $Q$), but it's possible that $\exists x\,P(x) \land Q(x)$ is true. This is what you want to say when you say "In my opinion, the row with $(T,T)$ should be undecidable", but that's not a thing we can talk about without quantifiers: without quantifiers, rows aren't allowed to be undecidable.