Lecture 6 - Exercises
Part A - Logical
Operators (and, or, not)
Let:
- \(N =\) True
- \(P =\) True
- \(Q =\) False
- \(S =\) True
and evaluate the following statements. You may find it helpful to
draw a truth table for the more complicated expressions:
- \(N \land P\)
- \(Q \land S\)
- \(Q \lor N\)
- \(\neg P\)
- \(P \land (Q \lor S)\)
- \(N \land P \land Q\)
- \(\neg N \lor \neg Q\)
- \((N \lor P) \land \neg(Q \land
S)\)
Part B - Conditional
Statements
- Given \(N, P, Q,\) and \(S\) from above, evaluate the following
statements:
- \(P \Rightarrow Q\)
- \(P \Rightarrow S\)
- \(Q \Rightarrow S\)
- \((N \land P) \Rightarrow (Q \lor
S)\)
- Give the truth value of each of the following conditional
statements:
- If the moon is made of green cheese, then 1 = 2.
- If 1 = 1, then the moon is made of green cheese.
- If 1 = 1, then 30 = 30.
- If 1 = 1, then 30 = 12.
- If 1 = 2, then 30 = 30.
- If 1 = 2, then 30 = 10.
Part C - Conditionals
in Natural Language
- Without changing their meanings, convert each of the following
sentences into a sentence having the form “If P, then Q”:
- Whenever people agree with me I feel I must be wrong.
- An integer is divisible by 8 only if it is divisible by 4.
- You fail only if you stop writing.
Part D - Biconditional
Statements
- Fill out a truth table with the following five columns:
- \(P\)
- \(Q\)
- \(P\Rightarrow Q\)
- \(Q\Rightarrow P\)
- \(P \Leftrightarrow Q\)
Describe in words under what circumstances \(P \Leftrightarrow Q\) is true.
Part E - Equivalences
- Verify using a truth table that \(P
\Leftrightarrow Q\) is logically equivalent to \((P \land Q) \lor (\neg P \land \neg
Q)\)
- Find a way to express \(P \Rightarrow
Q\) using any logical operators except $.
- Find a way to express \(P \land Q\)
using any logical operators except \(\land\) and \(\Rightarrow\).