The first quiz is a little misleading because he appeals to what this means in English. The sentence "If 5 is an odd number, then Paris is the capital of France," is false, since we know there is no connection. He is actually asking about the propositional logic truth values.

It is kind of a cop out to say that implication \(P \Rightarrow Q\) is just defined that way. There are really good reasons for it. To understand, you first need to accept that the truth value of a sentence has nothing to do with whether it is a coherent idea in the real world, and it says nothing about the truth of it's component pieces., it only checks to see if it is consistent with every else we know. If I tell you that if it is raining, I bring my umbrella, it is not raining, and I did bring my umbrella anyway:

\[

\begin{align}

&R \Rightarrow U\\

&\neg R\\

&U

\end{align}

\]

What do we want to say about the truth of \(R \Rightarrow U\)? is that sentence suddenly false just because I brought my umbrella on a sunny day? Does that mean I won't the next time it rains? Of course not, just because \(R\) is false doesn't make that rule suddenly untrue. It is still consistent with the other stuff we know. The only way we can say for sure that the rule is false is if we see a counter-example: \(R \wedge \neg U\). Now, if that's true, then we know the rule as stated must be false.

Another way to think about this is to look at the truth tables. What if we said that for the implication \(P \Rightarrow Q\) when

*P*is false, the whole thing is false? In that case, the truth table would be identical to the "and" truth table. Do we really want to say that \(P \Rightarrow Q\) means the same thing as \(P \wedge Q\)? "If P is true then Q is true" means the same thing as "both P and Q are true?" What about if we said that the implication is true when both P and Q are false, but false when P is false and Q is true? Then if we look at the truth table, that's the same as equivalence: \(P \Leftrightarrow Q\). Do we really want to say that "If P is true then Q is true" means the same thing as "P and Q are the same"? The table we have is our only choice.

First order logic: Logics are deceptive. They're really easy to describe but they have lots of thorny implications. It's easy to watch this and thing you get it perfectly, but really you know nothing yet.

He just said \(\forall_x Vowel(x) \Rightarrow NumberOf(x) = 1\) is a

*valid*statement. He means valid in the loose English sense. It is not always true for all models.

That final quiz is a good example of how logic seems simple but gets tricky pretty fast.

## No comments:

## Post a Comment