The complete truth table of (q ∧ ¬r) ∨ ((r → p) ∧ p) is written out. In how many rows N is p = 1 and r = 0?
Propositional logic & proofs worksheet with answers
1.Easy
(q ∧ ¬r) ∨ ((r → p) ∧ p)
N =
2.Easy
Complete the truth table (1 = true, 0 = false). In how many rows N is (¬a → c) ↔ ¬b true?
(¬a → c) ↔ ¬b
N =
3.Medium
In how many of the 8 rows of its truth table is (q ∨ r) ∧ ¬(q ∧ (r ∨ ¬p)) true? Call this number N.
(q ∨ r) ∧ ¬(q ∧ (r ∨ ¬p))
N =
4.Medium
You want to prove ¬q → p by contrapositive. Which implication do you prove instead? Click it.
¬q → p
- 1¬¬q → ¬p
- 2p → ¬q
- 3¬p → ¬¬q
- 4¬q ∧ ¬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
The premises (a ∧ c) → b; a; ¬b are given. Which conclusion follows from them? Click it.
(a ∧ c) → ba¬b
- 1c ∧ ¬b
- 2c
- 3b
- 4¬c
Answer key
- 1. N = 2
- 2. N = 4
- 3. N = 3
- 4. ¬p → ¬¬q
- 5. ∀x (P(x) ∧ ¬Q(x))
- 6. ¬c
Full step-by-step solutions: practise this topic on examproblems.com.