Exactly one row of the truth table makes a → b 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 false. Click that row.
The complete truth table of ((q ∧ ¬r) ↔ ¬q) ∨ ¬(p ∧ r) is written out. In how many rows N is p = 1 and r = 0?
In how many of the 8 rows of its truth table is ¬(¬p ∧ (¬r → q)) ∨ (r ∨ (q → p)) true? Call this number N.
Which formula is logically equivalent to q ∧ (p ∨ r)? Click it.
The argument with premises b → a; a and conclusion b is invalid. Click the row of the truth table that is a counterexample.
Which statement is equivalent to ¬∃x A(x), with the negation moved all the way inside? Click it.
Full step-by-step solutions: practise this topic on examproblems.com.