This is Discrete Mathematics Note 1 Here I am using the logi

This is Discrete Mathematics Note 1: Here I am using the logician’s symbol ~ for NOT. Note 2: Although it is never explicitly stated in the readings, the standard operator precedence for logical operators is ~ (highest), /\\, \\/, -->, <-->(lowest). This means, for example, that p <--> q --> r \\/ s /\\ ~t must be interpreted as p <--> (q (-->(r \\/ (s /\\ ~t)))) Problem 3: Define a new logical operation NAND (“not and”) by the following rule p NAND q <--> ~(p /\\ q) Determine whether or not the NAND operation obeys the associative law.

Solution