How many rows N does the complete truth table of ¬((¬p → (q ↔ r)) ∧ (p → ¬q)) have?
Propositional logic & proofs worksheet with answers
1.Easy
¬((¬p → (q ↔ r)) ∧ (p → ¬q))
N =
2.Easy
Complete the truth table (1 = true, 0 = false). In how many rows N is b ↔ (b ∧ ¬a) true?
b ↔ (b ∧ ¬a)
N =
3.Medium
Which formula is logically equivalent to ¬(r ↔ q)? Click it.
¬(r ↔ q)
- 1r ↔ ¬q
- 2r ∧ ¬q
- 3¬r ↔ ¬q
- 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
The argument with premises q → p; r → p and conclusion q → r is invalid. Click the row of the truth table that is a counterexample.
q → pr → p∴ q → r
- 1p = 1, q = 1, r = 1
- 2p = 1, q = 1, r = 0
- 3p = 1, q = 0, r = 1
- 4p = 1, q = 0, r = 0
- 5p = 0, q = 1, r = 1
- 6p = 0, q = 1, r = 0
- 7p = 0, q = 0, r = 1
- 8p = 0, q = 0, r = 0
6.Hard
Which statement is equivalent to ¬∃x F(x), with the negation moved all the way inside? Click it.
¬∃x F(x)
- 1∃x F(x)
- 2∀x F(x)
- 3∃x ¬F(x)
- 4∀x ¬F(x)
Answer key
- 1. N = 8
- 2. N = 3
- 3. r ↔ ¬q
- 4. (p ∧ q) ∧ ¬¬r
- 5. p = 1, q = 1, r = 0
- 6. ∀x ¬F(x)
Full step-by-step solutions: practise this topic on examproblems.com.