Exactly one row of the truth table makes p ∨ q false. Click that row.
- 1p = 1, q = 1
- 2p = 1, q = 0
- 3p = 0, q = 1
- 4p = 0, q = 0
Exactly one row of the truth table makes p ∨ q false. Click that row.
Complete the truth table (1 = true, 0 = false). In how many rows N is b ∧ (b ∨ a) true?
In how many of the 8 rows of its truth table is ((r ∨ ¬p) → q) ∧ (p ∨ r) true? Call this number N.
You want to prove ¬p → q by contrapositive. Which implication do you prove instead? Click it.
Which statement is equivalent to ¬∀x (F(x) → G(x)), with the negation moved all the way inside? Click it.
The argument with premises q → r; r and conclusion q is invalid. Click the row of the truth table that is a counterexample.
Full step-by-step solutions: practise this topic on examproblems.com.