--%>
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 : Explain Black–Scholes model Explain

    Explain Black–Scholes model.

    		•
  • Q : Maths A cricketer cn throw a ball to a

    A cricketer cn throw a ball to a max horizontl distnce of 100m. If he throws d same ball vertically upwards then the max height upto which he can throw is????

    		•
  • 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 : Mathematical Method for Engineers The

     The function is clearly undefined at , but despite all of this the function does have a limit as approaches 0. a) Use MATLAB and ezplot to sketch for , and use the zoom on facility to guess the . You need to include you M-file, outp

    		•
  • Q : Problem on mass balance law Using the

    Using the mass balance law approach, write down a set of word equations to model the transport of lead concentration. A) Draw a compartmental model to represent  the diffusion of lead through the lungs and the bloodstream.

    		•
  • Q : Who firstly use the finite-difference

    Who firstly use the finite-difference method?

    		•
  • Q : What is the definition of a group Group

    Group: Let G be a set. When we say that o is a binary operation on G, we mean that o is a function from GxG into G. Informally, o takes pairs of elements of G as input and produces single elements of G as output. Examples are the operations + and x of

    		•
  • Q : Pig Game Using the PairOfDice class

    Using the PairOfDice class design and implement a class to play a game called Pig. In this game the user competes against the computer. On each turn the player rolls a pair of dice and adds up his or her points. Whoever reaches 100 points first, wins. If a player rolls a 1, he or she loses all point

    		•
  • 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 : Area Functions & Theorem Area Functions

    Area Functions 1. (a) Draw the line y = 2t + 1 and use geometry to find the area under this line, above the t - axis, and between the vertical lines t = 1 and t = 3. (b) If x > 1, let A(x) be the area of the region that lies under the line y = 2t + 1 between t

    		•