Share
Explore BrainMass

Propositional Logic : DeMorgan's Laws and Truth Tables

Please see the attached file for the fully formatted problems.

Verify DeMorgan's laws (equation 1 and 2 below) using truth tables.
Prove the generalized DeMorgan's laws:

(1) (NOT(p1 p2 .... pk))

(2) (NOT(p1+p2+...+pk))

by induction on k, using the basic laws:

NOT(pq)

NOT(p+q)

Then, justify the generalized laws informally by describing what 2k row truth tables for each expression and their subexpressions look like.

Attachments

Solution Summary

DeMorgan's Laws and Truth Tables are investigated. The solution is detailed and well presented. The solution was given a rating of "5" by the student who originally posted the question.

$2.19