Discrete Mathematics, Discrete Maths, Combinatorics, Permutations, Graph Theory.
that ¬(p ∧ q) = ¬p ∨ ¬q. These laws are useful for producing logical equivalence, which is when two statements have the same truth value in all possible cases. Conditional statements are statements of the form “if p, then q”, which are denoted by “p → q”. The negation of a conditional statement is