SLOG #2

So this week was pretty interesting, with the introduction of conjunction, disjunction, and negation, came some challenging problems. But obviously before one could go at these problems, there is the task of understanding how exactly each tool is used or expressed, and then there comes the hard parts. For me, these parts included figuring out equivalent expressions and translation from English to symbolic form. For example, I had some difficulty translating couple of the tutorial questions. One in particular was "No Course has more than 2 prerequisites". My initial answer was something in the line of, for all 'y' and for all 'x', P(x ,y),  x < 3 , but soon after I realized that we can introduce other variables and that if we can prove it for one then it becomes True for all (since we declare that at the beginning that the following is True for all courses in 'C'). So basically other than few mistakes here and there, everything went was OK this week.