--%>
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 : State Prime number theorem Prime number

    Prime number theorem: A big deal is known about the distribution of prime numbers and of the prime factors of a typical number. Most of the mathematics, although, is deep: while the results are often not too hard to state, the proofs are often diffic

    		•
  • 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 : 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 : Calculus I need it within 4 hours. Due

    I need it within 4 hours. Due time March 15, 2014. 3PM Pacific Time. (Los Angeles, CA)

    		•
  • Q : Explain Factorisation by Fermats method

    Factorisation by Fermat's method: This method, dating from 1643, depends on a simple and standard algebraic identity. Fermat's observation is that if we wish to nd two factors of n, it is enough if we can express n as the di fference of two squares.

    		•
  • 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 : State Measuring complexity Measuring

    Measuring complexity: Many algorithms have an integer n, or two integers m and n, as input - e.g., addition, multiplication, exponentiation, factorisation and primality testing. When we want to describe or analyse the `easiness' or `hardness' of the a

    		•
  • Q : Formulating linear program of an oil

    An oil company blends two input streams of crude oil products alkylate and catalytic cracked to meet demand for weekly contracts for regular (12,000 barrels) mind grade ( 7,500) and premium ( 4,500 barrels) gasoline’s . each week they can purchase up to 15, 000

    		•
  • Q : Uniform scaling what is uniform scaling

    what is uniform scaling in computer graphic

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

    		•