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