Exactly one row of the truth table makes (a ∨ 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 (a ∨ b) ∨ (b ∧ a) false. Click that row.
The complete truth table of ¬(((¬a ∧ b) ∧ c) ∨ (c ∧ a)) is written out. In how many rows N is b = 1 and c = 0?
Which formula is logically equivalent to r → q? Click it.
Which formula is logically equivalent to ¬(q → r)? Click it.
The premises (a ∧ b) → c; a; ¬c are given. Which conclusion follows from them? Click it.
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.