--%>

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 : Explain a rigorous theory for Brownian

    Explain a rigorous theory for Brownian motion developed by Wiener Norbert.

  • 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 : 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 : 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 : Formal logic It's a problem set, they

    It's a problem set, they are attached. it's related to Sider's book which is "Logic to philosophy" I attached the book too. I need it on feb22 but feb23 still work

  • 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 : Research Areas in Medical Mathematical

    Some Research Areas in Medical Mathematical Modelling:1. Modeling and numerical simulations of the nanometric aerosols in the lower portion of the bronchial tree. 2. Multiscale mathematical modeling of

  • 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 : Who firstly discovered mathematical

    Who firstly discovered mathematical theory for random walks, that rediscovered later by Einstein?