click below
click below
Normal Size Small Size show me how
Discrete Math 1-2
Question | Answer |
---|---|
De Morgan laws | (not)(p v q) and (not)p ^ (not)q are logically equivalent |
Identity laws | p ^ T <-> p || p v F <-> p |
Domination laws | p v T <-> T || p ^ F <-> F |
Idempotent laws | p v p <-> p || p ^ p <-> p |
Double Negation law | (not) ( (not) p ) <-> p |
Communtative laws | p v q <-> q v p || p ^ q <-> q ^ p |
Associative laws | (p v q) v r <-> p v (q v r)(p ^ q) ^ r <-> p ^ (q ^ r) |
Distributive laws | p v (q ^ r) <-> (p v q) ^ (p v r)p ^ (q v r) <-> (p ^ q) v (p ^ r) |
Absorption laws | p v (p ^ q) <-> p || p ^ (p v q) <-> p |
Negation laws | p v (not)p <-> T || p ^ (not)p <-> F |