--%>
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 : 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 : 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 : Where would we be without stochastic

    Where would we be without stochastic or Ito^ calculus?

    		•
  • 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 : Who firstly use the finite-difference

    Who firstly use the finite-difference method?

    		•
  • Q : Law of iterated expectations for

     Prove the law of iterated expectations for continuous random variables. 2. Prove that the bounds in Chebyshev's theorem cannot be improved upon. I.e., provide a distribution that satisfies the bounds exactly for k ≥1, show that it satisfies the bounds exactly, and draw its PDF. T

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

    Explain the work and model proposed by Richardson.

    		•
  • Q : Who developed a rigorous theory for

    Who developed a rigorous theory for Brownian motion?

    		•
  • Q : Profit-loss based problems A leather

    A leather wholesaler supplies leather to shoe companies. The manufacturing quantity requirements of leather differ depending upon the amount of leather ordered by the shoe companies to him. Due to the volatility in orders, he is unable to precisely predict what will b

    		•