Truth tables and logic
1. Construct a truth table for p → ~q
2. Construct a truth table for (~p V q) ↔ q
3. Let p represent the statement, “Jim plays football”, and let q represent “Michael plays basketball”. Convert the compound statements into symbols. It is not the case that Jim does not play football or Michael does not play basketball.
4. Write the compound statement in words.
Let p = The monitor is included.
q = The color printer is optional.
~(p V q)