Unformatted text preview: CSE 20: Discrete Mathematics Fall 2011 Problem Set 1 Instructor: Daniele Micciancio Due on: Wed. October 5, 2011 This homework assignment is based on Section 1.1 of the textbook. If you are stuck on any of the problems, give a more careful read to those sections of the book, including the examples and exercises at the end of each section, and most likely you will find a hint about what to do. Problem 1 (6 points) Write each of the following statements in symbolic form using the symbols ¬ , ∧ , ∨ and → , and atomic propositions P=“It is a duck”, Q = “It talks like a duck”, R=”It walks like a duck”. 1. If it walks like a duck and it talks like a duck, then it is a duck. 2. Either it does not walk like a duck or it does not talk like a duck, or or it is not a duck. 3. If it does not walk like a duck or it does not talk like a duck, then it is not a duck. Use the truth table method to determine if any of the 3 statements above are logically equivalent....
View
Full Document
 Spring '08
 Foster
 Logic, truth table method, Daniele Micciancio

Click to edit the document details