--%>
Assignment Help - homework help

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 : Graph Theory is the n-Dimensional Qn

    is the n-Dimensional Qn Hamiltonian? Prove tour answer

    		•
  • Q : Problem on Linear equations Anny, Betti

    Anny, Betti and Karol went to their local produce store to bpought some fruit. Anny bought 1 pound of apples and 2 pounds of bananas and paid $2.11.  Betti bought 2 pounds of apples and 1 pound of grapes and paid $4.06.  Karol bought 1 pound of bananas and 2

    		•
  • Q : Logic and math The homework is attached

    The homework is attached in the first two files, it's is related to Sider's book, which is "Logic for philosophy" I attached this book too, it's the third file.

    		•
  • Q : Ordinary Differential Equation or ODE

    What is an Ordinary Differential Equation (ODE)?

    		•
  • Q : Probability and Stochastic assignment

    Introduction to Probability and Stochastic Assignment 1: 1. Consider an experiment in which one of three boxes containing microchips is chosen at random and a microchip is randomly selected from the box.

    		•
  • 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

    		•
  • Q : Uniform scaling what is uniform scaling

    what is uniform scaling in computer graphic

    		•
  • 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 : 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

    		•