Exactly one row of the truth table makes ¬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 ¬b ↔ (¬b ∧ ¬a) false. Click that row.
The complete truth table of ¬((¬a ∨ b) ∧ b) → (c ∧ ¬a) is written out. In how many rows N is b = 1 and c = 0?
Is ¬((p ∧ q) → p) a tautology, a contradiction or a contingency? Click your answer.
You want to prove q → p by contradiction. Which statement do you assume at the start? Click it.
The argument with premises r ∨ q; r 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 → ¬p) ∨ r) → (¬p ∨ s)) true? Call this number N.
Full step-by-step solutions: practise this topic on examproblems.com.