Complete the truth table (1 = true, 0 = false). In how many rows N is (q ∧ p) ↔ (p → q) true?
Propositional logic & proofs worksheet with answers
1.Easy
(q ∧ p) ↔ (p → q)
N =
2.Easy
Exactly one row of the truth table makes ¬(¬b ∨ (¬a ↔ b)) true. Click that row.
¬(¬b ∨ (¬a ↔ b))
- 1a = 1, b = 1
- 2a = 1, b = 0
- 3a = 0, b = 1
- 4a = 0, b = 0
3.Medium
In how many of the 8 rows of its truth table is (c → b) → ¬(b → (c ∨ ¬a)) true? Call this number N.
(c → b) → ¬(b → (c ∨ ¬a))
N =
4.Medium
You want to prove r → q by contradiction. Which statement do you assume at the start? Click it.
r → q
- 1¬r ∧ q
- 2¬r ∧ ¬q
- 3¬r → ¬q
- 4r ∧ ¬q
5.Hard
Which statement is equivalent to ¬∀x (F(x) → ∃y R(x, y)), with the negation moved all the way inside? Click it.
¬∀x (F(x) → ∃y R(x, y))
- 1∃x (¬F(x) ∧ ∃y R(x, y))
- 2∃x (F(x) → ∀y ¬R(x, y))
- 3∀x (F(x) ∧ ∀y ¬R(x, y))
- 4∃x (F(x) ∧ ∀y ¬R(x, y))
6.Hard
Which statement is equivalent to ¬∀x F(x), with the negation moved all the way inside? Click it.
¬∀x F(x)
- 1∀x F(x)
- 2∃x ¬F(x)
- 3∃x F(x)
- 4∀x ¬F(x)
Answer key
- 1. N = 2
- 2. a = 1, b = 1
- 3. N = 3
- 4. r ∧ ¬q
- 5. ∃x (F(x) ∧ ∀y ¬R(x, y))
- 6. ∃x ¬F(x)
Full step-by-step solutions: practise this topic on examproblems.com.