Tuesday, January 14, 2014

2.9-2.10, due January 14

1. (Difficult) The relationship between the existential qualifier and the universal qualifier is NOT difficult. However, the negation algebra (if you can call it that) of an equation that has multiple variables qualified with the above listed can get very tricky. Also, grasping the amount of symbols and their definitions in words can be difficult.
2. (Reflective) I was waiting for a list of properties to use to simplify and rearrange logic statements, and I got them in 2.9 (pg. 49). They aren't as extensive as I was expecting, which shows that we may not be using a lot of simplifying and proving one logic statement is equal to another.

No comments:

Post a Comment