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