week2

This I learned sets, existential claim, how to evaluate claims, and implication. Some of them I have learned in my high school. Changing the claim into some sets or expressing by symbols is more convenient and easy. Sometimes drawing Venn diagrams is very helpful. For example, like what we did in this week’s tutorial, the answer will be obvious if we draw two sets which are python programs and test suites, and we only need to think about the meaning for each region. It’s my first time to learn the disjunction and negation. The most difficult part in this week may be how to express a sentence into some mathematical symbols. It is also tough to negate expressions. We really need to understand every word of the expression and pay attention to the words such as ‘all’, ‘some’, ‘every’, ‘less’ and so on. These will help us to solve the problem. Negating the expression is the most difficult part for me. After class, I searched that online and discussed with my friends to make it easier.  I enjoy doing proofs of universal or existential claims which is similar to doing some mathematical proofs. Finding the counter example or showing there is no counter example. The course material is very similar to what I learned in the math courses about the logic, sets. Computer science is always connected to mathematic. This class will help me do better in math courses by learning this basis logic concept.