'Idempotent laws' presentation slideshows

Discrete Mathematics CS 2610

Discrete Mathematics CS 2610. September 26. Equal Boolean Functions. Two Boolean functions F and G of degree n are equal iff for all (x 1 ,..x n ) ?? B n , F (x 1 ,..x n ) = G (x 1 ,..x n )

344 views • 17 slides

Properties of Sets

Properties of Sets. Lecture 26 Section 5.2 Tue, Mar 6, 2007. Proving Basic Properties. Theorem: Let A and B be sets. Then A ? B ? A . Proof: Let x ? A ? B . Then x ? A and x ? B . Therefore, x ? A . So A ? B ? A . Comments.

1.33k views • 16 slides

Discrete Mathematics Lecture 5

444 views • 16 slides

Set Operations

Set Operations. Union Intersection Relative Complement Absolute Complement. Likened to Logical Or and Logical And. Likened to logical Negation. Set Operations: Union of Sets. The union of two sets is the set that contains elements belonging to either of the two sets

749 views • 14 slides

Boolean Logic and Circuits

236 views • 10 slides