--%>

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 : 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 : 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 : Theorem-Group is unique and has unique

    Let (G; o) be a group. Then the identity of the group is unique and each element of the group has a unique inverse.In this proof, we will argue completely formally, including all the parentheses and all the occurrences of the group operation o. As we proce

  • 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 : Define Well-formed formulas or Wffs

    Wffs (Well-formed formulas): These are defined inductively by the following clauses:    (i) If  P  is an n-ary predicate and  t1, …, tn are terms, then P(t1, …, t

  • Q : Global And Regional Economic Development

    The Pharmatec Group, a supplier of pharmaceutical equipment, systems and services, has its head office in London and primary production facilities in the US. The company also has a successful subsidiary in South Africa, which was established in 1990. Pharmatec South A

  • 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 : Problem on Fermats method A public key

    A public key for RSA is published as n = 17947 and a = 3. (i) Use Fermat’s method to factor n. (ii) Check that this defines a valid system and find the private key X.

    Q : Problem on reduced row-echelon The

    The augmented matrix from a system of linear equations has the following reduced row-echelon form. 280_row echelon method.jpg

  • 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