Exactly one row of the truth table makes (¬q ∨ p) ∨ (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 (¬q ∨ p) ∨ (p ∧ q) false. Click that row.
How many rows N does the complete truth table of (r ∨ q) → ¬((¬r ↔ q) ↔ ¬p) have?
Is ((c → a) ∧ (a → b)) → (c → b) a tautology, a contradiction or a contingency? Click your answer.
Is ((r → q) ∧ (q → p)) → (r → p) a tautology, a contradiction or a contingency? Click your answer.
How many of the 16 rows of the truth table make ¬(((r → s) ∨ (r ∧ q)) → (q ∧ p)) true? Call this number N.
The argument with premises p → (r ∨ q); p and conclusion 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.