Exactly one row of the truth table makes ¬((¬p ↔ q) ∧ p) 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) false. Click that row.
Complete the truth table (1 = true, 0 = false). In how many rows N is (a ↔ b) ∨ (a ∧ ¬b) true?
In how many of the 8 rows of its truth table is (r → (p ∧ r)) ∧ (q ∧ (p ↔ q)) true? Call this number N.
In how many of the 8 rows of its truth table is (q ∧ (¬r ∨ ¬p)) → (¬p ∧ ¬(r ∨ q)) true? Call this number N.
Which statement is equivalent to ¬∃x ∀y R(x, y), with the negation moved all the way inside? Click it.
The argument with premises p → q; r → q and conclusion p → 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.