Exactly one row of the truth table makes p ∧ (q ↔ ¬p) true. 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 ↔ ¬p) true. Click that row.
Exactly one row of the truth table makes p ∨ q false. Click that row.
You want to prove (r ∨ p) → q by contrapositive. Which implication do you prove instead? Click it.
Which formula is logically equivalent to r ∨ (p ∧ q)? Click it.
Which statement is equivalent to ¬∃x (P(x) → Q(x)), with the negation moved all the way inside? Click it.
How many of the 16 rows of the truth table make ((¬d ∨ b) ∧ (c → b)) ↔ ((d ∨ c) ∨ ¬a) true? Call this number N.
Full step-by-step solutions: practise this topic on examproblems.com.