Exactly one row of the truth table makes (q ↔ 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 (q ↔ p) → q false. Click that row.
Exactly one row of the truth table makes a ∨ (b ↔ a) false. Click that row.
In how many of the 8 rows of its truth table is (r → (q ∨ ¬p)) ↔ (r ∨ q) true? Call this number N.
Which formula is logically equivalent to ¬(b → a)? Click it.
The argument with premises p → (q ∨ r); p and conclusion q is invalid. Click the row of the truth table that is a counterexample.
How many of the 16 rows of the truth table make ((q ↔ s) ∧ p) ∧ ((¬r ∨ q) ∨ (r → p)) true? Call this number N.
Full step-by-step solutions: practise this topic on examproblems.com.