Exactly one row of the truth table makes 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 p ∨ q false. Click that row.
Complete the truth table (1 = true, 0 = false). In how many rows N is p → ¬q true?
Which formula is logically equivalent to r ∧ (p ∨ q)? Click it.
Which formula is logically equivalent to ¬(b ∧ a)? Click it.
The argument with premises c → a; a and conclusion c is invalid. Click the row of the truth table that is a counterexample.
How many of the 16 rows of the truth table make ((r → s) ∧ p) ∧ ((q ∨ ¬s) → q) true? Call this number N.
Full step-by-step solutions: practise this topic on examproblems.com.