Chapter 1 - Section 1.3 - Propositional Equivalences - Exercises - Page 36: 62

a. Satisfiable b. Satisfiable c. Satisfiable

a) if p is true and q is false ($\neg q $ is true), then the compound proposition is true and thus the compound proposition is satisfiable. b) if p is true, q is false ($\neg q $ is true) and s is false ($\neg s$ is true), then the compound proposition is true and thus the compound proposition is satisfiable. c) If p is false ($\neg p$ is true), q is true, r is false ($\neg r $ is true) and s is false ($\neg s$ is true), then the compound proposition is true and thus the compound proposition is satisfiable.