Homework 3 - Cisco Spring 2013

- Read Chapters/Sections 6, 7.1-7.5, 8 of the textbook.
**Problems**: Turn in written solutions (hardcopy/printout) ONLY TO THE PROBLEMS MARKED WITH AN ASTERISK "*" BELOW at the beginning of class when the homework is due. Solve the other problems before the class so that you can ask questions about them in preparation for Exam 1.**Chapter 6:**6.2, 6.3, 6.4, 6.5, 6.6*, 6.7, 6.8* (show your work, not just the final coloring), 6.9, 6.10 (useful for testing your project), 6.11, 6.14, 6.15, 6.16.**Chapter 7:**7.1, 7.4, 7.5 (remember to prove both directions of the "if and only if"), 7.6*, 7.7* (Note that the models must assign truth values each propositional letter A, B, C, and D, not just to the propositional letters appearing in the sentence. Also, note that A . B . C is shortcut for (A . B) . C, which is also equivalent to A . (B . C) ), 7.9, 7.10,- *
Determine whether the following sentence is valid, unsatisfiable, or neither.
Justify your answer with either truth tables, equivalent rewrites of the sentence,
or both.
(!! q => !p) => (p => !q)

- *
Determine whether the following sentence is valid, unsatisfiable, or neither.
Justify your answer with either truth tables, equivalent rewrites of the sentence,
or both.