--%>
Assignment Help - homework help

Elementary Logic Set & Model of a Boolean Algebra

Prove that Elementary Logic Set is a Model of a Boolean Algebra

The three Boolean operations of Logic are the three logical operations of  OR ( V ), AND (upside down V), and NEGATION ~.  Addition is the logical OR , multiplication is the logical AND, and complement is the logical NEGATION.  The symbol 1 is the logical T (True), and the symbol 0 is the logical F (False) . (Just state the Boolean Algebra versions of logical statements below, the proofs are considered self-evident, we do not require Truth Tables to be written to establish their validity.)

1. State the commutative law of addition: _________________________________________

2. State the associative law of addition: ___________________________________________

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

4. State the commutative law of multiplication: _____________________________________

5. State the associative law of multiplication: _______________________________________

6. State the law that says T is a multiplicative identity _______________________________

7. State the distributive law of multiplication: _______________________________________

8. State the distributive law of addition: ____________________________________________

9.   State the Boolean Algebra property x  +  ˜ x  = 1 in terms of a logical statement A.

 10.   State the Boolean Algebra property x  •  ˜ x  = 0 in terms of a logical statement A.

The above ten properties are necessary and sufficient conditions to prove that Elementary Logic is indeed a model of a Boolean algebra.

11. In Elementary Logic, A implies B ( A-> B), has a Truth table, which we recall is only False (F), when B is False and A is True.  Rewrite the logical statement

A -> B in terms of the basic logical operations of AND (upside down V, we will have to use in this document the symbol ?), OR (V) and NEGATION (~).

A -> B =   

12. In terms of an Abstract Boolean Algebra, for two elements x and y define that x implies y,  x -> y using the basic operations  +,  •, and ~ of  Boolean Algebra, using the definition from Elementary Logic as your guide.

x -> y  

Recall that in Elementary Logic a Tautology is a statement which is always True, regardless of the truth values of its constituent statements., e.g.  A V ~A .

13. Write the Truth table for the logical statement (A->B)  V (B->A).   

Is (A->B)  V (B->A)  a tautology?

14. Write the Truth table for the logical statement  (B ? (A->B) ) ->A  (recall ? is unfortunately our symbol for AND, the upside down V).   

Is (B ? (A->B) ) ->A a tautology?

   Related Questions in Mathematics

  • 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 : 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 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 the work and model proposed by

    Explain the work and model proposed by Richardson.

    		•
  • 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 : Test Please read the assignment

    Please read the assignment carefully and confirm only if you are 100% sure. Please go through below mentioned guidelines and penalties: • Your solution must be accurate and complete. • Please do not change Subject Title of the Email. • Penalty clause will be applied in case of delayed or plag

    		•
  • Q : Ordinary Differential Equation or ODE

    What is an Ordinary Differential Equation (ODE)?

    		•
  • Q : First-order formulas over the

    Consider the unary relational symbols P and L, and the binary relational symbol On, where P(a) and I(a) encode that a is apoint and a (sraight) line in the 2-dimensional space, respectively, while On(a,b) encodes  that a is a point, b is a line, and o lies on b.

    		•
  • Q : How do it? integral e^(-t)*e^(tz) t

    integral e^(-t)*e^(tz) t between 0 and infinity for Re(z)<1

    		•
  • Q : Abstract Boolean Algebra I. Boolean

    I. Boolean Algebra Define an abstract Boolean Algebra, B,  as follows:  The three operations are:  +   ( x + y addition) ( x y multiplic

    		•