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