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