Exactly one row of the truth table makes 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 p ∧ (q ↔ p) true. Click that row.
How many rows N does the complete truth table of ¬((r ∧ (q → p)) ∨ ((q ∧ ¬p) → ¬r)) have?
You want to prove (q ∧ r) → p by contrapositive. Which implication do you prove instead? Click it.
Which formula is logically equivalent to c → a? Click it.
The argument with premises r → (p ∨ q); r and conclusion p is invalid. Click the row of the truth table that is a counterexample.
Which statement is equivalent to ¬∃x (F(x) → G(x)), with the negation moved all the way inside? Click it.
Full step-by-step solutions: practise this topic on examproblems.com.