--%>
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 : Numerical solution of PDE i want you to

    i want you to solve this assignment. this consist of two parts theoretical and coding. the code has to be created by you. no modified or copying code. you have to mention the exact solution and the proportion error. also you have to explain the sketch that you get from the code. these information

    		•
  • 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 : Explain Black–Scholes model Explain

    Explain Black–Scholes model.

    		•
  • Q : Problem on Prime theory Suppose that p

    Suppose that p and q are different primes and n = pq. (i) Express p + q in terms of Ø(n) and n. (ii) Express p - q in terms of p + q and n. (iii) Expl

    		•
  • Q : Examples of groups Examples of groups:

    Examples of groups: We now start to survey a wide range of examples of groups (labelled by (A), (B), (C), . . . ). Most of these come from number theory. In all cases, the group axioms should be checked. This is easy for almost all of the examples, an

    		•
  • Q : First-order formulas over the

    Consider the unary relational symbols P and L, and the binary relational symbol On, where P(a) and I(a) encode that a is apoint and a (sraight) line in the 2-dimensional space, respectively, while On(a,b) encodes  that a is a point, b is a line, and o lies on b.

    		•
  • Q : Profit-loss based problems A leather

    A leather wholesaler supplies leather to shoe companies. The manufacturing quantity requirements of leather differ depending upon the amount of leather ordered by the shoe companies to him. Due to the volatility in orders, he is unable to precisely predict what will b

    		•
  • Q : Theorem-G satis es the right and left

    Let G be a group. (i) G satis es the right and left cancellation laws; that is, if a; b; x ≡ G, then ax = bx and xa = xb each imply that a = b. (ii) If g ≡ G, then (g-1)

    		•
  • Q : Problem on sales and budget XYZ Farm

    XYZ Farm Supply data regarding the store's operations follow: • Sales are budgeted at $480,000 for November, $430,000 for December, and $340,000 for January. • Collections are expected

    		•
  • Q : Relationships Between Data Introduction

    Relationships Between Data - Introduction to Linear Regression Simple Regression Notes If you need guidance in terms of using Excel to run regressions, check pages 1 - 10 of the Excel - Linear Regression Tutorial posted to th

    		•