--%>

Abstract Boolean Algebra

I. Boolean Algebra

Define an abstract Boolean Algebra, B,  as follows:

 The three operations are:

 +   ( x + y addition)

  • ( x y multiplication)~

˜ ( ˜ x  the complement  or the negation of x)

{B, + , 0 } is a commutative monoid

1. State the commutative law of addition: ___________________________________________

2. State the associative law of addition: _____________________________________________

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

{B, • , 1 } is a commutative monoid

4. State the commutative law of multiplication: ____________________________________

5. State the associative law of multiplication: _______________________________________

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

7. State the distributive law of multiplication: ______________________________________

8. State the distributive law of addition: _____________________________________________

Finally  it is given that:

9.   x  +  ˜ x  = 1

10. x  •  ˜ x  = 0

The above ten properties are necessary and sufficient conditions to prove a given algebra is a Boolean algebra.

For a Boolean Algebra prove the idempotent properties:

1.  x  •  x  = x 

2.  x  +  x  = x 

For a Boolean Algebra prove the Zero and One Properties:

3.  0  •  x  = 0 

4.  1  +  x  = 1  

Prove the four Absorption Laws for a Boolean Algebra:

5.  x + (x  • y) = x 

6.  x  • ( x +  y) = x  

7.  x  +  (˜x • y) = x + y 

8.  x  • ( ˜x +  y) = x  •  y 

9. Prove that if the element y acts as the additive complement of x, i.e. x + y = 1, and y acts as the multiplicative complement of x, i.e. x•y = 0, then in fact x is the complement of y, i.e.  y =  ˜x.

Note.  The Involution Law:  ˜ ˜x = x, is true, by the fact of the uniqueness of the complement (see 9. above) and the fact that x acts as the complement of ˜x . 

Prove the following De Morgan Laws (Hint:  use the uniqueness of the complement)

10.  ˜ ( x + y ) = (˜x)  • (˜y)

11.  ˜ ( x + y ) = (˜x)  • (˜y)

   Related Questions in Mathematics

  • Q : Who had find Monte Carlo and finite

    Who had find Monte Carlo and finite differences of the binomial model?

  • Q : Uniform scaling what is uniform scaling

    what is uniform scaling in computer graphic

  • Q : Problem on mass balance law Using the

    Using the mass balance law approach, write down a set of word equations to model the transport of lead concentration. A) Draw a compartmental model to represent  the diffusion of lead through the lungs and the bloodstream.

  • 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

  • Q : Problem on Nash equilibrium In a

    In a project, employee and boss are working altogether. The employee can be sincere or insincere, and the Boss can either reward or penalize. The employee gets no benefit for being sincere but gets utility for being insincere (30), for getting rewarded (10) and for be

  • Q : Linear programming model of a Cabinet

    A cabinet company produces cabinets used in mobile and motor homes. Cabinets produced for motor homes are smaller and made from less expensive materials than those for mobile homes. The home office in Dayton Ohio has just distributed to its individual manufacturing ce

  • Q : Breakfast program if the average is

    if the average is 0.27 and we have $500 how much break fastest will we serve by 2 weeks

  • Q : Mathematical and Theoretical Biology

    Mathematical and theoretical biology is an interdisciplinary scientific research field with a range of applications in the fields of biology, biotechnology, and medicine. The field may be referred to as mathematical biology or biomathematics to stress the mathematical

  • Q : Problem on inventory merchandise AB

    AB Department Store expects to generate the following sales figures for the next three months:                            

  • Q : State Fermat algorithm The basic Fermat

    The basic Fermat algorithm is as follows: Assume that n is an odd positive integer. Set c = [√n] (`ceiling of √n '). Then we consider in turn the numbers c2 - n; (c+1)2 - n; (c+2)2 - n..... until a perfect square is found. If th