**Tom Kelliher, MA 190**

**Feb. 1, 2008**

Identity laws | |

Domination laws | |

Idempotent laws | |

Double negation law | |

Commutative laws | |

Distributive laws | |

De Morgan's laws | |

Absorption laws | |

Negation laws | |

- (5)
Verify using a truth table:
.
- (7 a, c)
Use De Morgan's laws to find the negation of
- Jan is rich and happy.
- Mei walks or takes the bus to class.

- (9 a, d)
Use truth tables to show that the following are tautologies
- (11 a, d)
Use a series of logical equivalences to show that the previous two compound
propositions are tautologies.
- (15)
Determine whether
is
a tautology.
- (23, 25)
Show that the following compound propositions are logically equivalent by
showing that both sides are true, or that both sides are false, for exactly
the same combinations of truth values of the propositional variables in
these expressions (whichever is easier).
- and .
- and .

Thomas P. Kelliher 2008-01-30 Tom Kelliher