--%>
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 : Formulating linear program of a

    A software company has a new product specifically designed for the lumber industry. The VP of marketing has been given a budget of $1,35,00to market the product over the quarter. She has decided that $35,000 of the budget will be spent promoting the product at the nat

    		•
  • 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 : 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 : What is Non-Logical Vocabulary

    Non-Logical Vocabulary: 1. Predicates, called also relation symbols, each with its associated arity. For our needs, we may assume that the number of predicates is finite. But this is not essential. We can have an infinite list of predicates, P

    		•
  • Q : Explain the work and model proposed by

    Explain the work and model proposed by Richardson.

    		•
  • 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 : How do it? integral e^(-t)*e^(tz) t

    integral e^(-t)*e^(tz) t between 0 and infinity for Re(z)<1

    		•
  • Q : What is Big-O hierarchy The big-O

    The big-O hierarchy: A few basic facts about the big-O behaviour of some familiar functions are very important. Let p(n) be a polynomial in n (of any degree). Then logbn is O(p(n)) and p(n) is O(an<

    		•
  • Q : Explain lognormal stochastic

    Explain lognormal stochastic differential equation for evolution of an asset.

    		•
  • Q : Statistics Caterer determines that 37%

    Caterer determines that 37% of people who sampled the food thought it was delicious. A random sample of 144 out of population of 5000. The 144 are asked to sample the food. If P-hat is the proportion saying that the food is delicious, what is the mean of the sampling distribution p-hat?

    		•