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