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