How many rows N does the complete truth table of (¬(¬b → a) → ¬c) ∨ (b ↔ c) have?
Propositional logic & proofs worksheet with answers
1.Easy
(¬(¬b → a) → ¬c) ∨ (b ↔ c)
N =
2.Easy
Exactly one row of the truth table makes ¬(¬(p ↔ q) → ¬q) true. Click that row.
¬(¬(p ↔ q) → ¬q)
- 1p = 1, q = 1
- 2p = 1, q = 0
- 3p = 0, q = 1
- 4p = 0, q = 0
3.Medium
You want to prove ¬r → p by contrapositive. Which implication do you prove instead? Click it.
¬r → p
- 1¬r ∧ ¬p
- 2¬p → ¬¬r
- 3p → ¬r
- 4¬¬r → ¬p
4.Medium
In how many of the 8 rows of its truth table is ((q ∧ p) → r) → ((¬p ↔ r) ∧ ¬q) true? Call this number N.
((q ∧ p) → r) → ((¬p ↔ r) ∧ ¬q)
N =
5.Hard
How many of the 16 rows of the truth table make ((¬r ∨ q) ∧ (s ∧ q)) ∨ ¬(s ↔ (¬p → r)) true? Call this number N.
((¬r ∨ q) ∧ (s ∧ q)) ∨ ¬(s ↔ (¬p → r))
N =
6.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))
Answer key
- 1. N = 8
- 2. p = 0, q = 1
- 3. ¬p → ¬¬r
- 4. N = 3
- 5. N = 11
- 6. ∀x (F(x) ∧ ¬G(x))
Full step-by-step solutions: practise this topic on examproblems.com.