Fully parenthesize each of the following compound propositions. That is, add parentheses so that the structure is determined by the parentheses without the need for rules of precedence.
There are 4 variables so there are
24 = 16 rows in the truth table.
Construct a truth table of p → (q ∧ p).
p | q | p | → | (q | ∧ | p) | |
---|---|---|---|---|---|---|---|
F | F | F | T | F | F | F | |
F | T | F | T | T | F | F | |
T | F | T | F | F | F | T | |
T | T | T | T | T | T | T |
Using a truth table, show that p → (q → p) is a tautology. (Show that it is true for all values of p and q.)
p | q | p | → | (q | → | p) | |
---|---|---|---|---|---|---|---|
F | F | F | T | F | T | F | |
F | T | F | T | T | F | F | |
T | F | T | T | F | T | T | |
T | T | T | T | T | T | T |
What is the negation of each of the following propositions?
Let p be proposition ``you get an A on the final exam,'' q be proposition ``you do every exercise in the book,'' and r be proposition ``you get an A in this class.'' Express each of the following English assertions in propositional logic using p, q and r.
It might help if you think of this as saying p is implied by r. That is, if you get an A in this class, you must have got an A on the final.
P is necessary for Q means Q → P.
P is sufficient for Q means P → Q.