--%>
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 : Explain the work and model proposed by

    Explain the work and model proposed by Richardson.

    		•
  • Q : Problem on Linear equations Anny, Betti

    Anny, Betti and Karol went to their local produce store to bpought some fruit. Anny bought 1 pound of apples and 2 pounds of bananas and paid $2.11.  Betti bought 2 pounds of apples and 1 pound of grapes and paid $4.06.  Karol bought 1 pound of bananas and 2

    		•
  • Q : Formal logic2 It's a problem set, they

    It's a problem set, they are attached. it's related to Sider's book which is "Logic to philosophy" I attached the book too. I need it on feb22 but feb23 still work

    		•
  • Q : Containee problem For queries Q 1 and Q

    For queries Q1 and Q2, we say Q1 is containedin Q2, denoted Q1 C Q2, iff Q1(D) C Q2

    		•
  • Q : Elementary Logic Set & Model of a

    Prove that Elementary Logic Set is a Model of a Boolean Algebra The three Boolean operations of Logic are the three logical operations of  OR ( V ), AN

    		•
  • 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 : 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

    		•
  • Q : Problem on mixed-strategy equilibrium

    Assume three Offices (A, B, & C) in downtown,  simultaneously decide whether to situate in a new Building. The payoff matrix is illustrated below. What is (are) the pure stratgy Nash equilibrium (or equilibria) and mixed-strtegy equilibrium of the game?

    		•
  • Q : Law of iterated expectations for

     Prove the law of iterated expectations for continuous random variables. 2. Prove that the bounds in Chebyshev's theorem cannot be improved upon. I.e., provide a distribution that satisfies the bounds exactly for k ≥1, show that it satisfies the bounds exactly, and draw its PDF. T

    		•
  • Q : Test Please read the assignment

    Please read the assignment carefully and confirm only if you are 100% sure. Please go through below mentioned guidelines and penalties: • Your solution must be accurate and complete. • Please do not change Subject Title of the Email. • Penalty clause will be applied in case of delayed or plag

    		•