Mathematics for Computer Science

(Frankie) #1

3.1. Propositions from Propositions 37


According to this table, the proposition “PANDQ” is true only whenPandQare
both true. This is probably the way you ordinarily think about the word “and.”
There is a subtlety in the truth table for “PORQ”:


P Q PORQ
T T T
T F T
F T T
F F F

The first row of this table says that “PORQ” is true even ifbothPandQare true.
This isn’t always the intended meaning of “or” in everyday speech, but this is the
standard definition in mathematical writing. So if a mathematician says, “You may
have cake, or you may have ice cream,” he means that youcouldhave both.
If you want to exclude the possibility of both having and eating, you should
combine them with theexclusive-oroperation,XOR:


P Q PXORQ
T T F
T F T
F T T
F F F

3.1.2 IMPLIES


The combining operation with the least intuitive technical meaning is “implies.”
Here is its truth table, with the lines labeled so we can refer to them later.


P Q P IMPLIESQ
T T T (tt)
T F F (tf)
F T T (ft)
F F T (ff)

Let’s experiment with this definition. For example, is the following proposition
true or false?


“If Goldbach’s Conjecture is true, thenx^2  0 for every real numberx.”

Now, we already mentioned that no one knows whether Goldbach’s Conjecture,
Proposition 1.1.7, is true or false. But that doesn’t prevent you from answering the
question! This proposition has the formP IMPLIESQwhere thehypothesis,P,
is “Goldbach’s Conjecture is true” and theconclusion,Q, is “x^2  0 for every

Free download pdf