Exactly one row of the truth table makes (a → ¬b) → (¬b → a) false. Click that row.
- 1a = 1, b = 1
- 2a = 1, b = 0
- 3a = 0, b = 1
- 4a = 0, b = 0
Exactly one row of the truth table makes (a → ¬b) → (¬b → a) false. Click that row.
Exactly one row of the truth table makes p → (q ↔ p) false. Click that row.
You want to prove q → (p ∨ r) by contradiction. Which statement do you assume at the start? Click it.
You want to prove q → (r ∧ p) by contradiction. Which statement do you assume at the start? Click it.
How many of the 16 rows of the truth table make ¬(((q ↔ p) ∨ (r ∨ ¬s)) ∨ (r ∧ ¬q)) true? Call this number N.
Which statement is equivalent to ¬∃x F(x), with the negation moved all the way inside? Click it.
Full step-by-step solutions: practise this topic on examproblems.com.