--%>
Assignment Help - homework help

Set Theory & Model of a Boolean Algebra

II. Prove that Set Theory is a Model of a Boolean Algebra

The three Boolean operations of Set Theory are the three set operations of union (U), intersection (upside down U), and complement ~.  Addition is set union, multiplication is set intersection, and the complement of a set is the set all elements that are in the universal set, but not in the set.  The universal set is the set of which all other sets are subsets and the empty set is the set, which has no elements and which therefore all other sets contain.  For purposes of this question, let S denote the universal set and Ø the empty set. (Just state the Boolean Algebra equalities of sets below, the proofs are considered self-evident, we do not require Venn diagrams to be written to establish their validity.)

1. State the commutative law of addition: _________________________________________

2. State the associative law of addition: _____________________________________________

3. State the law that says Ø is an additive identity __________________________________

4. State the commutative law of multiplication: ____________________________________

5. State the associative law of multiplication: _______________________________________

6. State the law that says S is a multiplicative identity _____________________________

7. State the distributive law of multiplication: ______________________________________

8. State the distributive law of addition: _____________________________________________

9.   State the Boolean Algebra property x  +  ˜ x  = 1 in terms of a set A.

10. State the Boolean Algebra property x  •  ˜ x  = 0 in terms of a set A.

The above ten properties are necessary and sufficient conditions to prove that Set Theory is indeed a model of a Boolean algebra.

11. In Set Theory the difference of two sets, A and B is defined as:

A - B = { s | s  belongs to A and s does not belong to B } 

Define the difference of two sets A and B, using the basic operations of set theory: union, intersection, and complement.

A - B =            

12. In terms of an Abstract Boolean Algebra, for two elements x and y define the difference, x - y using the basic operations  +,  •, and ~ of  Boolean Algebra, using the definition from Set Theory as your guide.

x - y  

13.  In Boolean Algebra rewrite the expression  x - (y + z) using only the basics operations of ~ , • and  +.

x - ( y + z ) = 

14.  Using the results of Boolean Algebra in problem 13 above, rewrite  the set theoretic expression of A - ( B U C ) using only the basics operations of set theory : union, intersection, and complement.

A - ( B U C ) = 

   Related Questions in Mathematics

  • Q : Mathematical Method for Engineers The

     The function is clearly undefined at , but despite all of this the function does have a limit as approaches 0. a) Use MATLAB and ezplot to sketch for , and use the zoom on facility to guess the . You need to include you M-file, outp

    		•
  • Q : Properties of a group How can we say

    How can we say that the pair (G, o) is a group. Explain the properties which proof it.

    		•
  • Q : Area Functions & Theorem Area Functions

    Area Functions 1. (a) Draw the line y = 2t + 1 and use geometry to find the area under this line, above the t - axis, and between the vertical lines t = 1 and t = 3. (b) If x > 1, let A(x) be the area of the region that lies under the line y = 2t + 1 between t

    		•
  • Q : Use MS Excel to do the computations

    Select a dataset of your interest (preferably related to your company/job), containing one variable and atleast 100 data points. [Example: Annual profit figures of 100 companies for the last financial year]. Once you select the data, you should compute 4-5 summary sta

    		•
  • Q : Abstract Algebra let a, b, c, d be

    let a, b, c, d be integers. Prove the following statements: (a) if a|b and b|c. (b) if a|b and ac|bd. (c) if d|a and d|b then d|(xa+yb) for any x, y EZ

    		•
  • Q : Problem on Maple (a) Solve the

    (a) Solve the following  by: (i) First reducing the system of first order differentiat equations to a second order differential equation. (ii) Decoupling the following linear system of equa

    		•
  • Q : Define Well-formed formulas or Wffs

    Wffs (Well-formed formulas): These are defined inductively by the following clauses:    (i) If  P  is an n-ary predicate and  t1, …, tn are terms, then P(t1, …, t

    		•
  • Q : Bolzano-Weierstrass property The

    The Bolzano-Weierstrass property does not hold in C[0, ¶] for the infinite set A ={sinnx:n<N} : A is infinite; Show that has no “ limit points”.

    		•
  • Q : Who derived the Black–Scholes Equation

    Who derived the Black–Scholes Equation?

    		•
  • Q : Pig Game Using the PairOfDice class

    Using the PairOfDice class design and implement a class to play a game called Pig. In this game the user competes against the computer. On each turn the player rolls a pair of dice and adds up his or her points. Whoever reaches 100 points first, wins. If a player rolls a 1, he or she loses all point

    		•