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