The complete truth table of ((¬b → ¬c) ∨ ¬b) → ¬(a → (¬c ∨ a)) is written out. In how many rows N is b = 1 and c = 0?
Propositional logic & proofs worksheet with answers
1.Easy
((¬b → ¬c) ∨ ¬b) → ¬(a → (¬c ∨ a))
N =
2.Easy
Exactly one row of the truth table makes ¬(q ∧ (q → p)) false. Click that row.
¬(q ∧ (q → p))
- 1p = 1, q = 1
- 2p = 1, q = 0
- 3p = 0, q = 1
- 4p = 0, q = 0
3.Medium
Is (p ∧ (p → q)) → q a tautology, a contradiction or a contingency? Click your answer.
(p ∧ (p → q)) → q
- 1tautology
- 2contradiction
- 3contingency
4.Medium
Is (q → r) ↔ (r → q) a tautology, a contradiction or a contingency? Click your answer.
(q → r) ↔ (r → q)
- 1tautology
- 2contradiction
- 3contingency
5.Hard
How many of the 16 rows of the truth table make (c ∧ (d ∧ b)) ∨ (¬c ∨ (d → a)) true? Call this number N.
(c ∧ (d ∧ b)) ∨ (¬c ∨ (d → a))
N =
6.Hard
Which statement is equivalent to ¬∃x (A(x) → B(x)), with the negation moved all the way inside? Click it.
¬∃x (A(x) → B(x))
- 1∀x (¬A(x) → ¬B(x))
- 2∀x (A(x) → ¬B(x))
- 3∀x (A(x) ∧ ¬B(x))
- 4∃x (A(x) ∧ ¬B(x))
Answer key
- 1. N = 2
- 2. p = 1, q = 1
- 3. tautology
- 4. contingency
- 5. N = 15
- 6. ∀x (A(x) ∧ ¬B(x))
Full step-by-step solutions: practise this topic on examproblems.com.