--%>

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 : Solve each equation by factoring A

    A college student invested part of a $25,000 inheritance at 7% interest and the rest at 6%.  If his annual interest is $1,670 how much did he invest at 6%?  If I told you the answer is $8,000, in your own words, using complete sentences, explain how you

  • Q : Mean and standard deviation of the data

    Below is the amount of rainfall (in cm) every month for the last 3 years in a particular location: 130 172 142 150 144 117 165 182 104 120 190 99 170 205 110 80 196 127 120 175

  • Q : Define Big-O notation Big-O notation :

    Big-O notation: If f(n) and g(n) are functions of a natural number n, we write f(n) is O(g(n)) and we say f is big-O of g if there is a constant C (independent of n) such that f

  • Q : How to get calculus homework done from

    How to get calculus homework done from tutor

  • Q : Elasticity of Demand For the demand

    For the demand function D(p)=410-0.2p(^2), find the maximum revenue.

  • 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 : 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 : 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 : Explain Factorisation by trial division

    Factorisation by trial division: The essential idea of factorisation by trial division is straightforward. Let n be a positive integer. We know that n is either prime or has a prime divisor less than or equal to √n. Therefore, if we divide n in

  • 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