In: Computer Science
In Exercises 1-9, prove each of the given statements from the given premises. You may use any of the following statements, with all occurrences of a letter replaced by a particular statement, as premises.
I) (P → S) ↔ ( ¬S → ¬P)
II) ¬Q ∧ (S ∨ Q) → S
III) ¬¬R ↔ R
IV) P → P ∨ R
In Exercises 1-7 use direct proofs.
2.) Premises: ¬S, P → S, ¬P ∨ Q → W
Prove: W